./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya --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 bfa28daccead4025689d4acb7ee77b26ba990cc9e83b74a1022dddbf4091a59b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:16:26,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:16:26,792 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:16:26,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:16:26,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:16:26,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:16:26,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:16:26,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:16:26,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:16:26,822 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:16:26,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:16:26,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:16:26,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:16:26,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:16:26,825 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:16:26,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:16:26,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:16:26,827 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:16:26,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:16:26,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:16:26,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:16:26,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:16:26,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:16:26,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:16:26,830 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:16:26,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:16:26,831 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:16:26,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:16:26,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:16:26,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:16:26,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:16:26,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:16:26,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:16:26,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:16:26,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:16:26,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:16:26,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:16:26,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:16:26,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:16:26,834 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:16:26,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:16:26,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:16:26,835 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_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/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_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya 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 -> bfa28daccead4025689d4acb7ee77b26ba990cc9e83b74a1022dddbf4091a59b [2023-11-29 02:16:27,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:16:27,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:16:27,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:16:27,070 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:16:27,071 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:16:27,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2023-11-29 02:16:29,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:16:30,006 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:16:30,006 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2023-11-29 02:16:30,015 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/data/f4bf5a632/3b5b2dd4f6a9456192e3dd93d91aa697/FLAG4c177454a [2023-11-29 02:16:30,029 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/data/f4bf5a632/3b5b2dd4f6a9456192e3dd93d91aa697 [2023-11-29 02:16:30,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:16:30,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:16:30,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:16:30,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:16:30,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:16:30,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b848b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30, skipping insertion in model container [2023-11-29 02:16:30,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,062 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:16:30,179 WARN L240 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_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i[916,929] [2023-11-29 02:16:30,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:16:30,228 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:16:30,238 WARN L240 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_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i[916,929] [2023-11-29 02:16:30,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:16:30,276 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:16:30,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30 WrapperNode [2023-11-29 02:16:30,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:16:30,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:16:30,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:16:30,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:16:30,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,325 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2023-11-29 02:16:30,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:16:30,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:16:30,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:16:30,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:16:30,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,355 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]. [2023-11-29 02:16:30,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:16:30,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:16:30,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:16:30,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:16:30,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (1/1) ... [2023-11-29 02:16:30,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:16:30,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:16:30,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:16:30,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:16:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:16:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:16:30,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:16:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:16:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:16:30,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:16:30,519 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:16:30,521 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:16:30,795 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:16:30,824 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:16:30,825 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:16:30,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:30 BoogieIcfgContainer [2023-11-29 02:16:30,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:16:30,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:16:30,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:16:30,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:16:30,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:16:30" (1/3) ... [2023-11-29 02:16:30,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6770012d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:16:30, skipping insertion in model container [2023-11-29 02:16:30,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:30" (2/3) ... [2023-11-29 02:16:30,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6770012d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:16:30, skipping insertion in model container [2023-11-29 02:16:30,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:30" (3/3) ... [2023-11-29 02:16:30,835 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-33.i [2023-11-29 02:16:30,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:16:30,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:16:30,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:16:30,897 INFO L357 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, mHoare=true, 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;@12bad7be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:16:30,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:16:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:16:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 02:16:30,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:30,910 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:30,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:30,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2011261731, now seen corresponding path program 1 times [2023-11-29 02:16:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:30,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778337151] [2023-11-29 02:16:30,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:31,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:31,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778337151] [2023-11-29 02:16:31,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778337151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:31,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:31,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:16:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736611675] [2023-11-29 02:16:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:31,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:16:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:31,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:16:31,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:16:31,253 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 02:16:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:31,284 INFO L93 Difference]: Finished difference Result 111 states and 192 transitions. [2023-11-29 02:16:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:16:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 85 [2023-11-29 02:16:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:31,294 INFO L225 Difference]: With dead ends: 111 [2023-11-29 02:16:31,294 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 02:16:31,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:16:31,300 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:31,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 02:16:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-29 02:16:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:16:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 86 transitions. [2023-11-29 02:16:31,337 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 86 transitions. Word has length 85 [2023-11-29 02:16:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:31,338 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 86 transitions. [2023-11-29 02:16:31,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 02:16:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 86 transitions. [2023-11-29 02:16:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 02:16:31,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:31,343 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:31,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:16:31,343 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:31,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1026638627, now seen corresponding path program 1 times [2023-11-29 02:16:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:31,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310735845] [2023-11-29 02:16:31,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:31,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:31,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:31,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310735845] [2023-11-29 02:16:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310735845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:31,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:31,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:16:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846642837] [2023-11-29 02:16:31,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:31,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:31,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:31,596 INFO L87 Difference]: Start difference. First operand 55 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:31,626 INFO L93 Difference]: Finished difference Result 110 states and 173 transitions. [2023-11-29 02:16:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:16:31,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 02:16:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:31,629 INFO L225 Difference]: With dead ends: 110 [2023-11-29 02:16:31,629 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 02:16:31,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:31,632 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:31,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 02:16:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-29 02:16:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.5) internal successors, (63), 42 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:16:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2023-11-29 02:16:31,643 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 85 [2023-11-29 02:16:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:31,645 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2023-11-29 02:16:31,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2023-11-29 02:16:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 02:16:31,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:31,647 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:31,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:16:31,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:31,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1835985253, now seen corresponding path program 1 times [2023-11-29 02:16:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:31,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022197981] [2023-11-29 02:16:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022197981] [2023-11-29 02:16:31,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022197981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:31,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:31,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:16:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160187953] [2023-11-29 02:16:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:31,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:16:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:16:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:16:31,845 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:32,045 INFO L93 Difference]: Finished difference Result 145 states and 225 transitions. [2023-11-29 02:16:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:16:32,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 02:16:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:32,048 INFO L225 Difference]: With dead ends: 145 [2023-11-29 02:16:32,048 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 02:16:32,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:32,051 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:32,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 278 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:16:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 02:16:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 58. [2023-11-29 02:16:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:16:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 89 transitions. [2023-11-29 02:16:32,062 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 89 transitions. Word has length 85 [2023-11-29 02:16:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:32,063 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 89 transitions. [2023-11-29 02:16:32,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 89 transitions. [2023-11-29 02:16:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 02:16:32,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:32,065 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:32,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:16:32,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:32,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1134920675, now seen corresponding path program 1 times [2023-11-29 02:16:32,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:32,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462589447] [2023-11-29 02:16:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:33,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462589447] [2023-11-29 02:16:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462589447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:33,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:16:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761454592] [2023-11-29 02:16:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:33,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:16:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:33,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:16:33,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:33,751 INFO L87 Difference]: Start difference. First operand 58 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:34,468 INFO L93 Difference]: Finished difference Result 180 states and 279 transitions. [2023-11-29 02:16:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:16:34,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 02:16:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:34,470 INFO L225 Difference]: With dead ends: 180 [2023-11-29 02:16:34,470 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 02:16:34,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:16:34,472 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 120 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:34,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 332 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:16:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 02:16:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2023-11-29 02:16:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 65 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:16:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2023-11-29 02:16:34,483 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 85 [2023-11-29 02:16:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:34,483 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2023-11-29 02:16:34,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2023-11-29 02:16:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 02:16:34,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:34,485 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:34,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:16:34,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:34,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1571698719, now seen corresponding path program 1 times [2023-11-29 02:16:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:34,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178465077] [2023-11-29 02:16:34,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178465077] [2023-11-29 02:16:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178465077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:16:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063138619] [2023-11-29 02:16:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:34,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:16:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:34,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:16:34,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:34,981 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:35,373 INFO L93 Difference]: Finished difference Result 212 states and 329 transitions. [2023-11-29 02:16:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:16:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 02:16:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:35,376 INFO L225 Difference]: With dead ends: 212 [2023-11-29 02:16:35,376 INFO L226 Difference]: Without dead ends: 134 [2023-11-29 02:16:35,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:16:35,378 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 144 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:35,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 358 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:16:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-29 02:16:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 68. [2023-11-29 02:16:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.5) internal successors, (81), 54 states have internal predecessors, (81), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:16:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2023-11-29 02:16:35,388 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 85 [2023-11-29 02:16:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:35,389 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2023-11-29 02:16:35,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2023-11-29 02:16:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 02:16:35,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:35,391 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:35,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:16:35,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:35,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash 667005088, now seen corresponding path program 1 times [2023-11-29 02:16:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:35,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73154792] [2023-11-29 02:16:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:35,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:35,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:35,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73154792] [2023-11-29 02:16:35,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73154792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:35,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:35,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:16:35,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814039579] [2023-11-29 02:16:35,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:35,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:35,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:35,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:35,467 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:35,514 INFO L93 Difference]: Finished difference Result 179 states and 275 transitions. [2023-11-29 02:16:35,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:16:35,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-11-29 02:16:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:35,516 INFO L225 Difference]: With dead ends: 179 [2023-11-29 02:16:35,516 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 02:16:35,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:35,518 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:35,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 182 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:35,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 02:16:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2023-11-29 02:16:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:16:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2023-11-29 02:16:35,529 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 86 [2023-11-29 02:16:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:35,530 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2023-11-29 02:16:35,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2023-11-29 02:16:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 02:16:35,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:35,532 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:35,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:16:35,533 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:35,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:35,533 INFO L85 PathProgramCache]: Analyzing trace with hash -39689868, now seen corresponding path program 1 times [2023-11-29 02:16:35,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:35,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64918888] [2023-11-29 02:16:35,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:35,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:35,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:35,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64918888] [2023-11-29 02:16:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64918888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:35,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:35,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:16:35,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013564472] [2023-11-29 02:16:35,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:35,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:35,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:35,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:35,602 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:35,640 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2023-11-29 02:16:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:16:35,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-11-29 02:16:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:35,643 INFO L225 Difference]: With dead ends: 188 [2023-11-29 02:16:35,643 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 02:16:35,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:35,644 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 71 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:35,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 142 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 02:16:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 69. [2023-11-29 02:16:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 02:16:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2023-11-29 02:16:35,653 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 86 [2023-11-29 02:16:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:35,654 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2023-11-29 02:16:35,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2023-11-29 02:16:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 02:16:35,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:35,656 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:35,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:16:35,656 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:35,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:35,657 INFO L85 PathProgramCache]: Analyzing trace with hash 259421737, now seen corresponding path program 1 times [2023-11-29 02:16:35,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:35,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852908351] [2023-11-29 02:16:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:35,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:35,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852908351] [2023-11-29 02:16:35,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852908351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:35,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:35,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:16:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127076922] [2023-11-29 02:16:35,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:35,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:16:35,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:16:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:35,772 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:36,011 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2023-11-29 02:16:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:16:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-11-29 02:16:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:36,014 INFO L225 Difference]: With dead ends: 224 [2023-11-29 02:16:36,014 INFO L226 Difference]: Without dead ends: 156 [2023-11-29 02:16:36,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:16:36,015 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 209 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:36,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 329 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:16:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-29 02:16:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2023-11-29 02:16:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 114 states have internal predecessors, (157), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 02:16:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2023-11-29 02:16:36,030 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 87 [2023-11-29 02:16:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:36,031 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2023-11-29 02:16:36,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2023-11-29 02:16:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 02:16:36,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:36,032 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:36,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:16:36,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:36,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 517587175, now seen corresponding path program 1 times [2023-11-29 02:16:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793355060] [2023-11-29 02:16:36,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:37,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793355060] [2023-11-29 02:16:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793355060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:16:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125535750] [2023-11-29 02:16:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:37,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:16:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:37,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:16:37,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:16:37,644 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:38,752 INFO L93 Difference]: Finished difference Result 415 states and 609 transitions. [2023-11-29 02:16:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:16:38,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-11-29 02:16:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:38,755 INFO L225 Difference]: With dead ends: 415 [2023-11-29 02:16:38,755 INFO L226 Difference]: Without dead ends: 276 [2023-11-29 02:16:38,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:16:38,756 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 279 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:38,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 355 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:16:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-29 02:16:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 161. [2023-11-29 02:16:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.4153846153846155) internal successors, (184), 132 states have internal predecessors, (184), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 02:16:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 236 transitions. [2023-11-29 02:16:38,772 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 236 transitions. Word has length 87 [2023-11-29 02:16:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:38,772 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 236 transitions. [2023-11-29 02:16:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2023-11-29 02:16:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 02:16:38,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:38,773 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:38,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:16:38,774 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:38,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1171356567, now seen corresponding path program 1 times [2023-11-29 02:16:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41823815] [2023-11-29 02:16:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41823815] [2023-11-29 02:16:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41823815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:38,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:38,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:16:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098866646] [2023-11-29 02:16:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:38,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:38,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:38,883 INFO L87 Difference]: Start difference. First operand 161 states and 236 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:38,960 INFO L93 Difference]: Finished difference Result 455 states and 667 transitions. [2023-11-29 02:16:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:16:38,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-11-29 02:16:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:38,964 INFO L225 Difference]: With dead ends: 455 [2023-11-29 02:16:38,964 INFO L226 Difference]: Without dead ends: 298 [2023-11-29 02:16:38,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:38,965 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 57 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:38,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 161 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:16:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-29 02:16:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 234. [2023-11-29 02:16:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 191 states have internal predecessors, (264), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 02:16:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2023-11-29 02:16:38,985 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 87 [2023-11-29 02:16:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:38,985 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2023-11-29 02:16:38,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2023-11-29 02:16:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 02:16:38,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:38,987 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:16:38,987 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:38,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash 835858693, now seen corresponding path program 1 times [2023-11-29 02:16:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:38,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825270196] [2023-11-29 02:16:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:39,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:39,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825270196] [2023-11-29 02:16:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825270196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:39,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:16:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990960332] [2023-11-29 02:16:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:39,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:16:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:16:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:16:39,536 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:39,965 INFO L93 Difference]: Finished difference Result 524 states and 748 transitions. [2023-11-29 02:16:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:16:39,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-29 02:16:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:39,968 INFO L225 Difference]: With dead ends: 524 [2023-11-29 02:16:39,968 INFO L226 Difference]: Without dead ends: 294 [2023-11-29 02:16:39,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:16:39,970 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 149 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:39,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 244 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:16:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-11-29 02:16:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 242. [2023-11-29 02:16:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 200 states have (on average 1.28) internal successors, (256), 201 states have internal predecessors, (256), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:16:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2023-11-29 02:16:39,990 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 88 [2023-11-29 02:16:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:39,991 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2023-11-29 02:16:39,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2023-11-29 02:16:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 02:16:39,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:39,992 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:39,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:16:39,993 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:39,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash 498286641, now seen corresponding path program 1 times [2023-11-29 02:16:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190403396] [2023-11-29 02:16:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190403396] [2023-11-29 02:16:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190403396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:16:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720760233] [2023-11-29 02:16:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:40,041 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:40,113 INFO L93 Difference]: Finished difference Result 457 states and 617 transitions. [2023-11-29 02:16:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:16:40,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-29 02:16:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:40,116 INFO L225 Difference]: With dead ends: 457 [2023-11-29 02:16:40,116 INFO L226 Difference]: Without dead ends: 337 [2023-11-29 02:16:40,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:40,117 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 64 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:40,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 178 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-29 02:16:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2023-11-29 02:16:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 279 states have (on average 1.2616487455197132) internal successors, (352), 280 states have internal predecessors, (352), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 02:16:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 448 transitions. [2023-11-29 02:16:40,143 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 448 transitions. Word has length 88 [2023-11-29 02:16:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:40,143 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 448 transitions. [2023-11-29 02:16:40,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 448 transitions. [2023-11-29 02:16:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 02:16:40,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:40,145 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:40,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:16:40,145 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:40,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1689607901, now seen corresponding path program 1 times [2023-11-29 02:16:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:40,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667656114] [2023-11-29 02:16:40,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:40,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:40,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667656114] [2023-11-29 02:16:40,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667656114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:40,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:40,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:16:40,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383471889] [2023-11-29 02:16:40,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:40,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:40,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:40,201 INFO L87 Difference]: Start difference. First operand 335 states and 448 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:40,271 INFO L93 Difference]: Finished difference Result 616 states and 816 transitions. [2023-11-29 02:16:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:16:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-29 02:16:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:40,274 INFO L225 Difference]: With dead ends: 616 [2023-11-29 02:16:40,274 INFO L226 Difference]: Without dead ends: 403 [2023-11-29 02:16:40,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:40,275 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:40,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 149 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-11-29 02:16:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2023-11-29 02:16:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 332 states have internal predecessors, (408), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 02:16:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 528 transitions. [2023-11-29 02:16:40,306 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 528 transitions. Word has length 88 [2023-11-29 02:16:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:40,306 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 528 transitions. [2023-11-29 02:16:40,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 528 transitions. [2023-11-29 02:16:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 02:16:40,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:40,307 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:40,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:16:40,307 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:40,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 414863964, now seen corresponding path program 1 times [2023-11-29 02:16:40,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:40,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832601611] [2023-11-29 02:16:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:40,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:40,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:40,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832601611] [2023-11-29 02:16:40,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832601611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:40,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:40,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:16:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688274741] [2023-11-29 02:16:40,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:40,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:16:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:16:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:40,388 INFO L87 Difference]: Start difference. First operand 401 states and 528 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:40,743 INFO L93 Difference]: Finished difference Result 944 states and 1245 transitions. [2023-11-29 02:16:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:16:40,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-29 02:16:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:40,748 INFO L225 Difference]: With dead ends: 944 [2023-11-29 02:16:40,748 INFO L226 Difference]: Without dead ends: 665 [2023-11-29 02:16:40,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:16:40,750 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 150 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:40,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 428 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:16:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-11-29 02:16:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 409. [2023-11-29 02:16:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 339 states have (on average 1.2359882005899705) internal successors, (419), 340 states have internal predecessors, (419), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 02:16:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 539 transitions. [2023-11-29 02:16:40,787 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 539 transitions. Word has length 88 [2023-11-29 02:16:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:40,787 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 539 transitions. [2023-11-29 02:16:40,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 539 transitions. [2023-11-29 02:16:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 02:16:40,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:40,788 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:40,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:16:40,789 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:40,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 673029402, now seen corresponding path program 1 times [2023-11-29 02:16:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:40,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053022493] [2023-11-29 02:16:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:40,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:40,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053022493] [2023-11-29 02:16:40,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053022493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:40,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:40,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:16:40,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397884025] [2023-11-29 02:16:40,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:40,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:16:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:16:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:40,861 INFO L87 Difference]: Start difference. First operand 409 states and 539 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:40,931 INFO L93 Difference]: Finished difference Result 688 states and 902 transitions. [2023-11-29 02:16:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:16:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-29 02:16:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:40,933 INFO L225 Difference]: With dead ends: 688 [2023-11-29 02:16:40,933 INFO L226 Difference]: Without dead ends: 401 [2023-11-29 02:16:40,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:16:40,935 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:40,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:16:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-11-29 02:16:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 302. [2023-11-29 02:16:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 246 states have (on average 1.2113821138211383) internal successors, (298), 247 states have internal predecessors, (298), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 02:16:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 394 transitions. [2023-11-29 02:16:40,961 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 394 transitions. Word has length 88 [2023-11-29 02:16:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:40,961 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 394 transitions. [2023-11-29 02:16:40,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 394 transitions. [2023-11-29 02:16:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 02:16:40,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:40,962 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:40,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:16:40,963 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:40,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1173483938, now seen corresponding path program 1 times [2023-11-29 02:16:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:40,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652261507] [2023-11-29 02:16:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:41,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:41,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652261507] [2023-11-29 02:16:41,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652261507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:41,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:41,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:16:41,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827415298] [2023-11-29 02:16:41,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:41,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:16:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:41,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:16:41,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:41,035 INFO L87 Difference]: Start difference. First operand 302 states and 394 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:41,205 INFO L93 Difference]: Finished difference Result 601 states and 783 transitions. [2023-11-29 02:16:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:16:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-29 02:16:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:41,207 INFO L225 Difference]: With dead ends: 601 [2023-11-29 02:16:41,207 INFO L226 Difference]: Without dead ends: 322 [2023-11-29 02:16:41,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:16:41,209 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 128 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:41,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 302 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:16:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-29 02:16:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 306. [2023-11-29 02:16:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 250 states have (on average 1.204) internal successors, (301), 251 states have internal predecessors, (301), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 02:16:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 397 transitions. [2023-11-29 02:16:41,234 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 397 transitions. Word has length 88 [2023-11-29 02:16:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:41,235 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 397 transitions. [2023-11-29 02:16:41,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2023-11-29 02:16:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 02:16:41,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:41,236 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:41,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:16:41,236 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:41,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash -915318500, now seen corresponding path program 1 times [2023-11-29 02:16:41,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:41,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271691543] [2023-11-29 02:16:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:41,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:41,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271691543] [2023-11-29 02:16:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271691543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:41,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:16:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310180431] [2023-11-29 02:16:41,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:41,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:16:41,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:16:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:16:41,329 INFO L87 Difference]: Start difference. First operand 306 states and 397 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:41,675 INFO L93 Difference]: Finished difference Result 717 states and 930 transitions. [2023-11-29 02:16:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:16:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-29 02:16:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:41,679 INFO L225 Difference]: With dead ends: 717 [2023-11-29 02:16:41,679 INFO L226 Difference]: Without dead ends: 433 [2023-11-29 02:16:41,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:41,680 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 201 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:41,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 242 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:16:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-11-29 02:16:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 290. [2023-11-29 02:16:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 234 states have (on average 1.188034188034188) internal successors, (278), 235 states have internal predecessors, (278), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 02:16:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 374 transitions. [2023-11-29 02:16:41,720 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 374 transitions. Word has length 88 [2023-11-29 02:16:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:41,721 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 374 transitions. [2023-11-29 02:16:41,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 374 transitions. [2023-11-29 02:16:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 02:16:41,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:41,722 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:41,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:16:41,722 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:41,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1884384765, now seen corresponding path program 1 times [2023-11-29 02:16:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187594862] [2023-11-29 02:16:41,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:41,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:41,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187594862] [2023-11-29 02:16:41,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187594862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:41,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:41,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:16:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757667125] [2023-11-29 02:16:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:41,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:16:41,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:16:41,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:41,839 INFO L87 Difference]: Start difference. First operand 290 states and 374 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:42,267 INFO L93 Difference]: Finished difference Result 641 states and 824 transitions. [2023-11-29 02:16:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:16:42,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-11-29 02:16:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:42,269 INFO L225 Difference]: With dead ends: 641 [2023-11-29 02:16:42,269 INFO L226 Difference]: Without dead ends: 374 [2023-11-29 02:16:42,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:42,270 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 195 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:42,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 354 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:16:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-11-29 02:16:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2023-11-29 02:16:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 258 states have (on average 1.1744186046511629) internal successors, (303), 259 states have internal predecessors, (303), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 02:16:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 423 transitions. [2023-11-29 02:16:42,309 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 423 transitions. Word has length 89 [2023-11-29 02:16:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:42,309 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 423 transitions. [2023-11-29 02:16:42,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 423 transitions. [2023-11-29 02:16:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 02:16:42,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:42,310 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:42,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:16:42,311 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:42,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:42,311 INFO L85 PathProgramCache]: Analyzing trace with hash -634544272, now seen corresponding path program 1 times [2023-11-29 02:16:42,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:42,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649966903] [2023-11-29 02:16:42,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:42,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649966903] [2023-11-29 02:16:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649966903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:16:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112694659] [2023-11-29 02:16:42,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:42,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:16:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:16:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:16:42,770 INFO L87 Difference]: Start difference. First operand 328 states and 423 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:43,376 INFO L93 Difference]: Finished difference Result 762 states and 972 transitions. [2023-11-29 02:16:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:16:43,377 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-11-29 02:16:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:43,380 INFO L225 Difference]: With dead ends: 762 [2023-11-29 02:16:43,380 INFO L226 Difference]: Without dead ends: 457 [2023-11-29 02:16:43,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:16:43,381 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 161 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:43,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 345 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:16:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-11-29 02:16:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 447. [2023-11-29 02:16:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 325 states have (on average 1.1292307692307693) internal successors, (367), 330 states have internal predecessors, (367), 100 states have call successors, (100), 21 states have call predecessors, (100), 21 states have return successors, (100), 95 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 02:16:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 567 transitions. [2023-11-29 02:16:43,485 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 567 transitions. Word has length 89 [2023-11-29 02:16:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:43,485 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 567 transitions. [2023-11-29 02:16:43,486 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 567 transitions. [2023-11-29 02:16:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 02:16:43,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:43,486 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:43,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:16:43,487 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:43,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash -958965774, now seen corresponding path program 1 times [2023-11-29 02:16:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639663176] [2023-11-29 02:16:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:43,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639663176] [2023-11-29 02:16:43,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639663176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:43,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:43,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:16:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246855734] [2023-11-29 02:16:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:43,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:16:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:16:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:16:43,575 INFO L87 Difference]: Start difference. First operand 447 states and 567 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:43,895 INFO L93 Difference]: Finished difference Result 1082 states and 1367 transitions. [2023-11-29 02:16:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:16:43,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-11-29 02:16:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:43,900 INFO L225 Difference]: With dead ends: 1082 [2023-11-29 02:16:43,900 INFO L226 Difference]: Without dead ends: 658 [2023-11-29 02:16:43,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:16:43,902 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 153 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:43,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 142 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:16:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2023-11-29 02:16:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 436. [2023-11-29 02:16:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 327 states have (on average 1.1376146788990826) internal successors, (372), 331 states have internal predecessors, (372), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-29 02:16:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 548 transitions. [2023-11-29 02:16:43,980 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 548 transitions. Word has length 90 [2023-11-29 02:16:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:43,980 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 548 transitions. [2023-11-29 02:16:43,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 548 transitions. [2023-11-29 02:16:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 02:16:43,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:43,981 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:43,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:16:43,981 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:43,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash -911658576, now seen corresponding path program 1 times [2023-11-29 02:16:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890565688] [2023-11-29 02:16:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:44,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890565688] [2023-11-29 02:16:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890565688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:44,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:44,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:16:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828693344] [2023-11-29 02:16:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:44,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:16:44,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:16:44,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:44,080 INFO L87 Difference]: Start difference. First operand 436 states and 548 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:44,298 INFO L93 Difference]: Finished difference Result 905 states and 1142 transitions. [2023-11-29 02:16:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:16:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-11-29 02:16:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:44,301 INFO L225 Difference]: With dead ends: 905 [2023-11-29 02:16:44,301 INFO L226 Difference]: Without dead ends: 470 [2023-11-29 02:16:44,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:16:44,303 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 126 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:44,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 235 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:16:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-11-29 02:16:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2023-11-29 02:16:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 325 states have (on average 1.1323076923076922) internal successors, (368), 329 states have internal predecessors, (368), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-29 02:16:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 544 transitions. [2023-11-29 02:16:44,377 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 544 transitions. Word has length 90 [2023-11-29 02:16:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:44,378 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 544 transitions. [2023-11-29 02:16:44,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 544 transitions. [2023-11-29 02:16:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 02:16:44,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:44,379 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:44,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:16:44,379 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:44,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1922775826, now seen corresponding path program 1 times [2023-11-29 02:16:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:44,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288110248] [2023-11-29 02:16:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288110248] [2023-11-29 02:16:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288110248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:16:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179653360] [2023-11-29 02:16:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:44,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:16:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:44,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:16:44,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:16:44,466 INFO L87 Difference]: Start difference. First operand 434 states and 544 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:44,713 INFO L93 Difference]: Finished difference Result 896 states and 1127 transitions. [2023-11-29 02:16:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:16:44,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-11-29 02:16:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:44,718 INFO L225 Difference]: With dead ends: 896 [2023-11-29 02:16:44,718 INFO L226 Difference]: Without dead ends: 463 [2023-11-29 02:16:44,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:44,720 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 70 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:44,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 235 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:16:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-11-29 02:16:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 432. [2023-11-29 02:16:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 323 states have (on average 1.1176470588235294) internal successors, (361), 327 states have internal predecessors, (361), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-29 02:16:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 537 transitions. [2023-11-29 02:16:44,797 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 537 transitions. Word has length 90 [2023-11-29 02:16:44,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:44,797 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 537 transitions. [2023-11-29 02:16:44,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 537 transitions. [2023-11-29 02:16:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 02:16:44,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:44,798 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:44,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:16:44,798 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:44,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1979164460, now seen corresponding path program 1 times [2023-11-29 02:16:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:44,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328088633] [2023-11-29 02:16:44,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:44,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:45,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:45,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328088633] [2023-11-29 02:16:45,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328088633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:45,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:16:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071554319] [2023-11-29 02:16:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:45,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:16:45,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:16:45,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:16:45,455 INFO L87 Difference]: Start difference. First operand 432 states and 537 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:45,729 INFO L93 Difference]: Finished difference Result 862 states and 1071 transitions. [2023-11-29 02:16:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:16:45,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-11-29 02:16:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:45,732 INFO L225 Difference]: With dead ends: 862 [2023-11-29 02:16:45,732 INFO L226 Difference]: Without dead ends: 431 [2023-11-29 02:16:45,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:16:45,734 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 57 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:45,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 178 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:16:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-11-29 02:16:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 419. [2023-11-29 02:16:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 310 states have (on average 1.103225806451613) internal successors, (342), 314 states have internal predecessors, (342), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-29 02:16:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 518 transitions. [2023-11-29 02:16:45,826 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 518 transitions. Word has length 90 [2023-11-29 02:16:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:45,826 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 518 transitions. [2023-11-29 02:16:45,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 518 transitions. [2023-11-29 02:16:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-29 02:16:45,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:45,828 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:45,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:16:45,829 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:45,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash -538538961, now seen corresponding path program 1 times [2023-11-29 02:16:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140328929] [2023-11-29 02:16:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:45,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:45,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140328929] [2023-11-29 02:16:45,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140328929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:45,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:45,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:16:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440158728] [2023-11-29 02:16:45,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:45,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:16:45,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:16:45,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:45,987 INFO L87 Difference]: Start difference. First operand 419 states and 518 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:46,485 INFO L93 Difference]: Finished difference Result 908 states and 1129 transitions. [2023-11-29 02:16:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:16:46,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2023-11-29 02:16:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:46,491 INFO L225 Difference]: With dead ends: 908 [2023-11-29 02:16:46,492 INFO L226 Difference]: Without dead ends: 490 [2023-11-29 02:16:46,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:16:46,494 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 223 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:46,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 307 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:16:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-11-29 02:16:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 419. [2023-11-29 02:16:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 310 states have (on average 1.1) internal successors, (341), 314 states have internal predecessors, (341), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-29 02:16:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 517 transitions. [2023-11-29 02:16:46,582 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 517 transitions. Word has length 91 [2023-11-29 02:16:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:46,582 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 517 transitions. [2023-11-29 02:16:46,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 517 transitions. [2023-11-29 02:16:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-29 02:16:46,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:46,584 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:46,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:16:46,584 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:46,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash -536691919, now seen corresponding path program 1 times [2023-11-29 02:16:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774753793] [2023-11-29 02:16:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774753793] [2023-11-29 02:16:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774753793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:46,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:16:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947779011] [2023-11-29 02:16:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:46,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:16:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:16:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:16:46,683 INFO L87 Difference]: Start difference. First operand 419 states and 517 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:46,891 INFO L93 Difference]: Finished difference Result 896 states and 1113 transitions. [2023-11-29 02:16:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:16:46,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2023-11-29 02:16:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:46,895 INFO L225 Difference]: With dead ends: 896 [2023-11-29 02:16:46,895 INFO L226 Difference]: Without dead ends: 478 [2023-11-29 02:16:46,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:46,897 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:46,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 326 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:16:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-11-29 02:16:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 411. [2023-11-29 02:16:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 302 states have (on average 1.096026490066225) internal successors, (331), 306 states have internal predecessors, (331), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-29 02:16:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 507 transitions. [2023-11-29 02:16:47,014 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 507 transitions. Word has length 91 [2023-11-29 02:16:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:47,014 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 507 transitions. [2023-11-29 02:16:47,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 507 transitions. [2023-11-29 02:16:47,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 02:16:47,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:47,016 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:47,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:16:47,017 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:47,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash 225298420, now seen corresponding path program 1 times [2023-11-29 02:16:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400707847] [2023-11-29 02:16:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:47,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400707847] [2023-11-29 02:16:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400707847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:47,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:47,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:16:47,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974104779] [2023-11-29 02:16:47,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:47,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:16:47,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:47,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:16:47,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:47,194 INFO L87 Difference]: Start difference. First operand 411 states and 507 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:47,719 INFO L93 Difference]: Finished difference Result 1017 states and 1253 transitions. [2023-11-29 02:16:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:16:47,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2023-11-29 02:16:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:47,723 INFO L225 Difference]: With dead ends: 1017 [2023-11-29 02:16:47,723 INFO L226 Difference]: Without dead ends: 607 [2023-11-29 02:16:47,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:16:47,724 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 198 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:47,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 291 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:16:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-11-29 02:16:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 416. [2023-11-29 02:16:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 307 states have (on average 1.0977198697068404) internal successors, (337), 311 states have internal predecessors, (337), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-11-29 02:16:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 513 transitions. [2023-11-29 02:16:47,815 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 513 transitions. Word has length 94 [2023-11-29 02:16:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:47,815 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 513 transitions. [2023-11-29 02:16:47,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 513 transitions. [2023-11-29 02:16:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 02:16:47,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:47,816 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:47,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 02:16:47,816 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:47,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash 227145462, now seen corresponding path program 1 times [2023-11-29 02:16:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:47,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424354942] [2023-11-29 02:16:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:16:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:16:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:16:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 02:16:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 02:16:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:16:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:16:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:16:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:16:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 02:16:48,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424354942] [2023-11-29 02:16:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424354942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:48,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:48,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:16:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429297837] [2023-11-29 02:16:48,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:48,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:16:48,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:48,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:16:48,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:16:48,335 INFO L87 Difference]: Start difference. First operand 416 states and 513 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:48,769 INFO L93 Difference]: Finished difference Result 445 states and 553 transitions. [2023-11-29 02:16:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:16:48,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2023-11-29 02:16:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:48,770 INFO L225 Difference]: With dead ends: 445 [2023-11-29 02:16:48,770 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 02:16:48,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:16:48,772 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 114 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:48,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 244 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:16:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 02:16:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 02:16:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:16:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 02:16:48,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2023-11-29 02:16:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:48,772 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:16:48,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 02:16:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 02:16:48,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 02:16:48,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:16:48,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 02:16:48,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 02:17:38,914 WARN L293 SmtUtils]: Spent 24.16s on a formula simplification. DAG size of input: 238 DAG size of output: 304 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 02:17:50,658 INFO L895 garLoopResultBuilder]: At program point L93-2(lines 93 99) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse6 (+ ~var_1_8~0 1)) (.cse0 (* .cse3 256))) (let ((.cse9 (+ ~var_1_8~0 .cse0 1)) (.cse10 (+ (* 256 (div .cse6 256)) ~var_1_7~0)) (.cse8 (+ ~var_1_5~0 1))) (let ((.cse2 (= (+ .cse0 ~var_1_16~0) ~var_1_7~0)) (.cse1 (or (= .cse9 .cse10) (< ~last_1_var_1_13~0 .cse8))) (.cse5 (* (div ~var_1_8~0 256) 256))) (or (and (not (= ~var_1_7~0 .cse0)) .cse1 (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2) (and (= (+ (* ~var_1_7~0 65534) 128) (+ (* .cse3 16776704) ~var_1_1~0 (* 65536 (div (+ 64 (* (- 8388352) .cse3) (* ~var_1_7~0 32767)) 32768)))) .cse1 (let ((.cse4 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse4) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse5 ~var_1_13~0)) .cse4))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (let ((.cse7 (< .cse9 .cse10))) (and (<= .cse6 (+ .cse5 ~var_1_7~0)) (or .cse7 (<= .cse8 ~last_1_var_1_13~0)) .cse1 (or (< ~var_1_8~0 (+ .cse5 ~var_1_16~0 ~var_1_13~0 1)) .cse7) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))))))) [2023-11-29 02:17:50,658 INFO L899 garLoopResultBuilder]: For program point L93-3(lines 93 99) no Hoare annotation was computed. [2023-11-29 02:17:50,658 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 02:17:50,658 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 02:17:50,658 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 02:17:50,659 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,659 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,659 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-11-29 02:17:50,659 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-29 02:17:50,659 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2023-11-29 02:17:50,659 INFO L899 garLoopResultBuilder]: For program point L53-4(line 53) no Hoare annotation was computed. [2023-11-29 02:17:50,659 INFO L899 garLoopResultBuilder]: For program point L53-6(line 53) no Hoare annotation was computed. [2023-11-29 02:17:50,659 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 62) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L87-2(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 37 62) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L87-4(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L87-6(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L87-7(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L87-8(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-29 02:17:50,660 INFO L899 garLoopResultBuilder]: For program point L87-10(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,661 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 43 51) no Hoare annotation was computed. [2023-11-29 02:17:50,661 INFO L899 garLoopResultBuilder]: For program point L87-12(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,661 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 02:17:50,661 INFO L899 garLoopResultBuilder]: For program point L87-14(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,661 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,661 INFO L899 garLoopResultBuilder]: For program point L87-16(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,661 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,661 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-11-29 02:17:50,661 INFO L899 garLoopResultBuilder]: For program point L87-18(line 87) no Hoare annotation was computed. [2023-11-29 02:17:50,662 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2023-11-29 02:17:50,662 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,662 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,662 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-29 02:17:50,662 INFO L899 garLoopResultBuilder]: For program point L81(lines 63 82) no Hoare annotation was computed. [2023-11-29 02:17:50,662 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse4 (* .cse3 256))) (let ((.cse1 (* (div ~var_1_8~0 256) 256)) (.cse2 (= (+ .cse4 ~var_1_16~0) ~var_1_7~0))) (or (and (let ((.cse0 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse0) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse1 ~var_1_13~0)) .cse0))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (and (<= (+ ~var_1_8~0 1) (+ .cse1 ~var_1_7~0)) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)) (and (not (= ~var_1_7~0 .cse4)) (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2))))) [2023-11-29 02:17:50,663 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse4 (* .cse3 256))) (let ((.cse1 (* (div ~var_1_8~0 256) 256)) (.cse2 (= (+ .cse4 ~var_1_16~0) ~var_1_7~0))) (or (and (let ((.cse0 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse0) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse1 ~var_1_13~0)) .cse0))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (and (<= (+ ~var_1_8~0 1) (+ .cse1 ~var_1_7~0)) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)) (and (not (= ~var_1_7~0 .cse4)) (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2))))) [2023-11-29 02:17:50,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 02:17:50,663 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,663 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,663 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-29 02:17:50,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 02:17:50,663 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-29 02:17:50,663 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-11-29 02:17:50,663 INFO L899 garLoopResultBuilder]: For program point L59-3(line 59) no Hoare annotation was computed. [2023-11-29 02:17:50,663 INFO L899 garLoopResultBuilder]: For program point L59-5(line 59) no Hoare annotation was computed. [2023-11-29 02:17:50,664 INFO L899 garLoopResultBuilder]: For program point L59-7(lines 59 61) no Hoare annotation was computed. [2023-11-29 02:17:50,664 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-11-29 02:17:50,664 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,664 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-11-29 02:17:50,664 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 02:17:50,664 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 02:17:50,664 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 02:17:50,664 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 02:17:50,667 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:17:50,668 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:17:50,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:17:50 BoogieIcfgContainer [2023-11-29 02:17:50,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:17:50,681 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:17:50,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:17:50,682 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:17:50,682 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:30" (3/4) ... [2023-11-29 02:17:50,684 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 02:17:50,688 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 02:17:50,695 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-29 02:17:50,696 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 02:17:50,696 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 02:17:50,696 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 02:17:50,796 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:17:50,797 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 02:17:50,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:17:50,798 INFO L158 Benchmark]: Toolchain (without parser) took 80764.94ms. Allocated memory was 163.6MB in the beginning and 755.0MB in the end (delta: 591.4MB). Free memory was 135.0MB in the beginning and 458.2MB in the end (delta: -323.2MB). Peak memory consumption was 271.4MB. Max. memory is 16.1GB. [2023-11-29 02:17:50,798 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:17:50,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.91ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 122.4MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 02:17:50,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.80ms. Allocated memory is still 163.6MB. Free memory was 122.4MB in the beginning and 119.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:17:50,800 INFO L158 Benchmark]: Boogie Preprocessor took 48.71ms. Allocated memory is still 163.6MB. Free memory was 119.2MB in the beginning and 116.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:17:50,800 INFO L158 Benchmark]: RCFGBuilder took 449.78ms. Allocated memory is still 163.6MB. Free memory was 116.1MB in the beginning and 94.0MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 02:17:50,800 INFO L158 Benchmark]: TraceAbstraction took 79852.58ms. Allocated memory was 163.6MB in the beginning and 755.0MB in the end (delta: 591.4MB). Free memory was 93.3MB in the beginning and 465.5MB in the end (delta: -372.3MB). Peak memory consumption was 418.2MB. Max. memory is 16.1GB. [2023-11-29 02:17:50,801 INFO L158 Benchmark]: Witness Printer took 115.73ms. Allocated memory is still 755.0MB. Free memory was 465.5MB in the beginning and 458.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 02:17:50,803 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.91ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 122.4MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.80ms. Allocated memory is still 163.6MB. Free memory was 122.4MB in the beginning and 119.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.71ms. Allocated memory is still 163.6MB. Free memory was 119.2MB in the beginning and 116.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.78ms. Allocated memory is still 163.6MB. Free memory was 116.1MB in the beginning and 94.0MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 79852.58ms. Allocated memory was 163.6MB in the beginning and 755.0MB in the end (delta: 591.4MB). Free memory was 93.3MB in the beginning and 465.5MB in the end (delta: -372.3MB). Peak memory consumption was 418.2MB. Max. memory is 16.1GB. * Witness Printer took 115.73ms. Allocated memory is still 755.0MB. Free memory was 465.5MB in the beginning and 458.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 79.8s, OverallIterations: 27, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 61.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3235 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3235 mSDsluCounter, 6688 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4104 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4312 IncrementalHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 2584 mSDtfsCounter, 4312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=19, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 1664 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 1173 PreInvPairs, 1282 NumberOfFragments, 730 HoareAnnotationTreeSize, 1173 FomulaSimplifications, 2650636 FormulaSimplificationTreeSizeReduction, 55.8s HoareSimplificationTime, 14 FomulaSimplificationsInter, 272468 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2382 NumberOfCodeBlocks, 2382 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2355 ConstructedInterpolants, 0 QuantifiedInterpolants, 11819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 7128/7128 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((!((var_1_7 == ((var_1_7 / 256) * 256))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && (0 <= (var_1_16 + var_1_13))) && ((((var_1_7 / 256) * 256) + var_1_16) == var_1_7)) || (((((((var_1_7 * 65534) + 128) == ((((var_1_7 / 256) * 16776704) + var_1_1) + (65536 * (((64 + (-8388352 * (var_1_7 / 256))) + (var_1_7 * 32767)) / 32768)))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && ((!(((256 * (var_1_14 / 256)) == var_1_14)) && (var_1_16 == var_1_13)) || ((var_1_8 == (((var_1_8 / 256) * 256) + var_1_13)) && ((256 * (var_1_14 / 256)) == var_1_14)))) && (var_1_15 == var_1_11)) && ((((var_1_7 / 256) * 256) + var_1_16) == var_1_7))) || ((((((((var_1_8 + 1) <= (((var_1_8 / 256) * 256) + var_1_7)) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) < ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || ((var_1_5 + 1) <= last_1_var_1_13))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && ((var_1_8 < (((((var_1_8 / 256) * 256) + var_1_16) + var_1_13) + 1)) || (((var_1_8 + ((var_1_7 / 256) * 256)) + 1) < ((256 * ((var_1_8 + 1) / 256)) + var_1_7)))) && (200 <= var_1_7)) && ((var_1_7 / 256) <= 0)) && ((var_1_13 + 1) <= var_1_7))) RESULT: Ultimate proved your program to be correct! [2023-11-29 02:17:50,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f186da-2d5a-4c15-aef5-5d9dad3c9c51/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE