./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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 dac49eff911c415c5e3abe3f83531cb71a1bf616fed1a86cc9f731a40011a721 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:39:13,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:39:13,972 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:39:13,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:39:13,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:39:14,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:39:14,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:39:14,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:39:14,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:39:14,005 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:39:14,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:39:14,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:39:14,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:39:14,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:39:14,008 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:39:14,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:39:14,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:39:14,010 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:39:14,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:39:14,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:39:14,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:39:14,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:39:14,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:39:14,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:39:14,013 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:39:14,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:39:14,014 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:39:14,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:39:14,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:39:14,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:39:14,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:39:14,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:39:14,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:39:14,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:39:14,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:39:14,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:39:14,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:39:14,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:39:14,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:39:14,017 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:39:14,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:39:14,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:39:14,018 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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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 -> dac49eff911c415c5e3abe3f83531cb71a1bf616fed1a86cc9f731a40011a721 [2023-11-28 20:39:14,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:39:14,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:39:14,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:39:14,269 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:39:14,269 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:39:14,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i [2023-11-28 20:39:17,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:39:17,298 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:39:17,299 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i [2023-11-28 20:39:17,309 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/data/16f7b5608/1ad9468a5aca49239ed3f1e6f470dd2a/FLAGfb73d5401 [2023-11-28 20:39:17,322 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/data/16f7b5608/1ad9468a5aca49239ed3f1e6f470dd2a [2023-11-28 20:39:17,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:39:17,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:39:17,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:39:17,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:39:17,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:39:17,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53850de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17, skipping insertion in model container [2023-11-28 20:39:17,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,364 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:39:17,484 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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i[917,930] [2023-11-28 20:39:17,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:39:17,570 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:39:17,580 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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i[917,930] [2023-11-28 20:39:17,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:39:17,650 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:39:17,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17 WrapperNode [2023-11-28 20:39:17,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:39:17,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:39:17,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:39:17,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:39:17,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,724 INFO L138 Inliner]: procedures = 29, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2023-11-28 20:39:17,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:39:17,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:39:17,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:39:17,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:39:17,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,766 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2023-11-28 20:39:17,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:39:17,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:39:17,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:39:17,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:39:17,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (1/1) ... [2023-11-28 20:39:17,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:39:17,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:39:17,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:39:17,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:39:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:39:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-28 20:39:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-28 20:39:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:39:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:39:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-28 20:39:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-28 20:39:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 20:39:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 20:39:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-28 20:39:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-28 20:39:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:39:17,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:39:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:39:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:39:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:39:17,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:39:18,042 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:39:18,044 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:39:18,528 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:39:18,566 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:39:18,566 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:39:18,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:18 BoogieIcfgContainer [2023-11-28 20:39:18,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:39:18,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:39:18,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:39:18,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:39:18,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:39:17" (1/3) ... [2023-11-28 20:39:18,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719f087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:39:18, skipping insertion in model container [2023-11-28 20:39:18,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:17" (2/3) ... [2023-11-28 20:39:18,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719f087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:39:18, skipping insertion in model container [2023-11-28 20:39:18,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:18" (3/3) ... [2023-11-28 20:39:18,576 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-56.i [2023-11-28 20:39:18,596 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:39:18,596 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:39:18,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:39:18,648 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;@330698c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:39:18,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:39:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 93 states have (on average 1.4838709677419355) internal successors, (138), 94 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:39:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-28 20:39:18,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:18,668 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:18,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:18,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1713327558, now seen corresponding path program 1 times [2023-11-28 20:39:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:18,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583553739] [2023-11-28 20:39:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:18,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:19,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583553739] [2023-11-28 20:39:19,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583553739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:19,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:19,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:19,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663789424] [2023-11-28 20:39:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:19,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:39:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:19,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:39:19,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:39:19,084 INFO L87 Difference]: Start difference. First operand has 115 states, 93 states have (on average 1.4838709677419355) internal successors, (138), 94 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:39:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:19,125 INFO L93 Difference]: Finished difference Result 227 states and 369 transitions. [2023-11-28 20:39:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:39:19,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2023-11-28 20:39:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:19,137 INFO L225 Difference]: With dead ends: 227 [2023-11-28 20:39:19,137 INFO L226 Difference]: Without dead ends: 113 [2023-11-28 20:39:19,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-28 20:39:19,143 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:19,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:39:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-28 20:39:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-28 20:39:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:39:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2023-11-28 20:39:19,184 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 146 [2023-11-28 20:39:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:19,185 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2023-11-28 20:39:19,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:39:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2023-11-28 20:39:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-28 20:39:19,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:19,190 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:19,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:39:19,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:19,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:19,191 INFO L85 PathProgramCache]: Analyzing trace with hash 254247592, now seen corresponding path program 1 times [2023-11-28 20:39:19,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:19,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088614150] [2023-11-28 20:39:19,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:19,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:19,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:19,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088614150] [2023-11-28 20:39:19,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088614150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:19,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:19,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218864638] [2023-11-28 20:39:19,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:19,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:19,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:19,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:19,482 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:19,523 INFO L93 Difference]: Finished difference Result 226 states and 343 transitions. [2023-11-28 20:39:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-11-28 20:39:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:19,526 INFO L225 Difference]: With dead ends: 226 [2023-11-28 20:39:19,526 INFO L226 Difference]: Without dead ends: 114 [2023-11-28 20:39:19,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-28 20:39:19,529 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:19,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:39:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-28 20:39:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-11-28 20:39:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:39:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2023-11-28 20:39:19,544 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 146 [2023-11-28 20:39:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:19,546 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2023-11-28 20:39:19,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2023-11-28 20:39:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-28 20:39:19,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:19,550 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:19,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:39:19,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:19,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:19,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1434696150, now seen corresponding path program 1 times [2023-11-28 20:39:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:19,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955802511] [2023-11-28 20:39:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955802511] [2023-11-28 20:39:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955802511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-28 20:39:26,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155285382] [2023-11-28 20:39:26,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:26,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:39:26,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:26,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:39:26,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:39:26,568 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:39:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:29,925 INFO L93 Difference]: Finished difference Result 501 states and 760 transitions. [2023-11-28 20:39:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-28 20:39:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 146 [2023-11-28 20:39:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:29,930 INFO L225 Difference]: With dead ends: 501 [2023-11-28 20:39:29,930 INFO L226 Difference]: Without dead ends: 388 [2023-11-28 20:39:29,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2023-11-28 20:39:29,933 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 1446 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:29,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1033 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 20:39:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-28 20:39:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 188. [2023-11-28 20:39:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.4217687074829932) internal successors, (209), 147 states have internal predecessors, (209), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:39:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 285 transitions. [2023-11-28 20:39:29,973 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 285 transitions. Word has length 146 [2023-11-28 20:39:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:29,974 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 285 transitions. [2023-11-28 20:39:29,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.176470588235294) internal successors, (54), 19 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:39:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 285 transitions. [2023-11-28 20:39:29,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-28 20:39:29,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:29,977 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:29,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:39:29,978 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:29,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1176530712, now seen corresponding path program 1 times [2023-11-28 20:39:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601255282] [2023-11-28 20:39:29,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:31,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601255282] [2023-11-28 20:39:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601255282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-28 20:39:31,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871278160] [2023-11-28 20:39:31,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:31,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 20:39:31,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:31,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 20:39:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:39:31,687 INFO L87 Difference]: Start difference. First operand 188 states and 285 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:33,672 INFO L93 Difference]: Finished difference Result 552 states and 845 transitions. [2023-11-28 20:39:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 20:39:33,673 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-11-28 20:39:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:33,677 INFO L225 Difference]: With dead ends: 552 [2023-11-28 20:39:33,677 INFO L226 Difference]: Without dead ends: 439 [2023-11-28 20:39:33,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2023-11-28 20:39:33,679 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 814 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:33,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1372 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-28 20:39:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-28 20:39:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 231. [2023-11-28 20:39:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 190 states have internal predecessors, (280), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:39:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 356 transitions. [2023-11-28 20:39:33,717 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 356 transitions. Word has length 146 [2023-11-28 20:39:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:33,718 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 356 transitions. [2023-11-28 20:39:33,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 356 transitions. [2023-11-28 20:39:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-28 20:39:33,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:33,721 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:33,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:39:33,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:33,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1849153896, now seen corresponding path program 1 times [2023-11-28 20:39:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:33,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995303376] [2023-11-28 20:39:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:33,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:33,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995303376] [2023-11-28 20:39:33,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995303376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:33,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:33,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171512119] [2023-11-28 20:39:33,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:33,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:33,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:33,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:33,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:33,856 INFO L87 Difference]: Start difference. First operand 231 states and 356 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:33,899 INFO L93 Difference]: Finished difference Result 369 states and 566 transitions. [2023-11-28 20:39:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:33,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-11-28 20:39:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:33,902 INFO L225 Difference]: With dead ends: 369 [2023-11-28 20:39:33,902 INFO L226 Difference]: Without dead ends: 256 [2023-11-28 20:39:33,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-28 20:39:33,904 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 42 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:33,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 355 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:39:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-28 20:39:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 232. [2023-11-28 20:39:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 191 states have (on average 1.4712041884816753) internal successors, (281), 191 states have internal predecessors, (281), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:39:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2023-11-28 20:39:33,933 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 146 [2023-11-28 20:39:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:33,934 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2023-11-28 20:39:33,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2023-11-28 20:39:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-28 20:39:33,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:33,937 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:33,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:39:33,937 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:33,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 488531884, now seen corresponding path program 1 times [2023-11-28 20:39:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:33,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776421995] [2023-11-28 20:39:33,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:33,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:34,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776421995] [2023-11-28 20:39:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776421995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:34,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237670204] [2023-11-28 20:39:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:34,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:34,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:34,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:34,059 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:34,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:34,102 INFO L93 Difference]: Finished difference Result 347 states and 531 transitions. [2023-11-28 20:39:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:34,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-11-28 20:39:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:34,106 INFO L225 Difference]: With dead ends: 347 [2023-11-28 20:39:34,106 INFO L226 Difference]: Without dead ends: 233 [2023-11-28 20:39:34,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-28 20:39:34,107 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:34,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:39:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-28 20:39:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2023-11-28 20:39:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 192 states have (on average 1.46875) internal successors, (282), 192 states have internal predecessors, (282), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:39:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 358 transitions. [2023-11-28 20:39:34,132 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 358 transitions. Word has length 146 [2023-11-28 20:39:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:34,133 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 358 transitions. [2023-11-28 20:39:34,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 358 transitions. [2023-11-28 20:39:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-28 20:39:34,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:34,135 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:34,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:39:34,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:34,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1755586944, now seen corresponding path program 1 times [2023-11-28 20:39:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641028035] [2023-11-28 20:39:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641028035] [2023-11-28 20:39:34,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641028035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:34,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:34,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:34,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443231466] [2023-11-28 20:39:34,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:34,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:34,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:34,264 INFO L87 Difference]: Start difference. First operand 233 states and 358 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:34,307 INFO L93 Difference]: Finished difference Result 348 states and 531 transitions. [2023-11-28 20:39:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-28 20:39:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:34,310 INFO L225 Difference]: With dead ends: 348 [2023-11-28 20:39:34,310 INFO L226 Difference]: Without dead ends: 233 [2023-11-28 20:39:34,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-28 20:39:34,312 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:34,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:39:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-28 20:39:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2023-11-28 20:39:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 192 states have (on average 1.4583333333333333) internal successors, (280), 192 states have internal predecessors, (280), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:39:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 356 transitions. [2023-11-28 20:39:34,343 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 356 transitions. Word has length 147 [2023-11-28 20:39:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:34,344 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 356 transitions. [2023-11-28 20:39:34,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 356 transitions. [2023-11-28 20:39:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-28 20:39:34,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:34,346 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:34,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:39:34,347 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:34,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1621908492, now seen corresponding path program 1 times [2023-11-28 20:39:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997175350] [2023-11-28 20:39:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:34,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:34,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997175350] [2023-11-28 20:39:34,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997175350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:34,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:34,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:34,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859022776] [2023-11-28 20:39:34,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:34,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:34,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:34,475 INFO L87 Difference]: Start difference. First operand 233 states and 356 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:34,518 INFO L93 Difference]: Finished difference Result 372 states and 565 transitions. [2023-11-28 20:39:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:34,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-28 20:39:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:34,521 INFO L225 Difference]: With dead ends: 372 [2023-11-28 20:39:34,522 INFO L226 Difference]: Without dead ends: 257 [2023-11-28 20:39:34,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-28 20:39:34,523 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 45 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:34,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 339 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:39:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-28 20:39:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2023-11-28 20:39:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 192 states have (on average 1.4375) internal successors, (276), 192 states have internal predecessors, (276), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:39:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 352 transitions. [2023-11-28 20:39:34,550 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 352 transitions. Word has length 147 [2023-11-28 20:39:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:34,550 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 352 transitions. [2023-11-28 20:39:34,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 352 transitions. [2023-11-28 20:39:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-28 20:39:34,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:34,553 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:34,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:39:34,553 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:34,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:34,553 INFO L85 PathProgramCache]: Analyzing trace with hash 342044814, now seen corresponding path program 1 times [2023-11-28 20:39:34,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:34,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375281213] [2023-11-28 20:39:34,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:34,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:35,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375281213] [2023-11-28 20:39:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375281213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:39:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787277776] [2023-11-28 20:39:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:35,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:39:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:39:35,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:39:35,416 INFO L87 Difference]: Start difference. First operand 233 states and 352 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:39:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:36,164 INFO L93 Difference]: Finished difference Result 423 states and 638 transitions. [2023-11-28 20:39:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:39:36,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-28 20:39:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:36,166 INFO L225 Difference]: With dead ends: 423 [2023-11-28 20:39:36,166 INFO L226 Difference]: Without dead ends: 308 [2023-11-28 20:39:36,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:39:36,168 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 540 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:36,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 415 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:39:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-11-28 20:39:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 249. [2023-11-28 20:39:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 208 states have (on average 1.4375) internal successors, (299), 208 states have internal predecessors, (299), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:39:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 375 transitions. [2023-11-28 20:39:36,193 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 375 transitions. Word has length 147 [2023-11-28 20:39:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:36,193 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 375 transitions. [2023-11-28 20:39:36,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:39:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 375 transitions. [2023-11-28 20:39:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-28 20:39:36,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:36,195 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:36,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:39:36,195 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:36,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1246113854, now seen corresponding path program 1 times [2023-11-28 20:39:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969750387] [2023-11-28 20:39:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:37,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:37,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969750387] [2023-11-28 20:39:37,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969750387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:37,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:37,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:39:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164182180] [2023-11-28 20:39:37,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:37,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:39:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:39:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:39:37,071 INFO L87 Difference]: Start difference. First operand 249 states and 375 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:39:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:37,749 INFO L93 Difference]: Finished difference Result 440 states and 661 transitions. [2023-11-28 20:39:37,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:39:37,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-28 20:39:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:37,752 INFO L225 Difference]: With dead ends: 440 [2023-11-28 20:39:37,753 INFO L226 Difference]: Without dead ends: 309 [2023-11-28 20:39:37,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:39:37,754 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 294 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:37,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 437 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:39:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-11-28 20:39:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 251. [2023-11-28 20:39:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 210 states have (on average 1.4333333333333333) internal successors, (301), 210 states have internal predecessors, (301), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:39:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 377 transitions. [2023-11-28 20:39:37,788 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 377 transitions. Word has length 147 [2023-11-28 20:39:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:37,789 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 377 transitions. [2023-11-28 20:39:37,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:39:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 377 transitions. [2023-11-28 20:39:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:39:37,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:37,791 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:37,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:39:37,792 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:37,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash -985029456, now seen corresponding path program 1 times [2023-11-28 20:39:37,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:37,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728290591] [2023-11-28 20:39:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:37,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:41,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:41,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728290591] [2023-11-28 20:39:41,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728290591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:41,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:41,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:39:41,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804740183] [2023-11-28 20:39:41,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:41,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:39:41,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:41,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:39:41,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:39:41,343 INFO L87 Difference]: Start difference. First operand 251 states and 377 transitions. Second operand has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:39:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:42,718 INFO L93 Difference]: Finished difference Result 506 states and 756 transitions. [2023-11-28 20:39:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:39:42,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:39:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:42,721 INFO L225 Difference]: With dead ends: 506 [2023-11-28 20:39:42,721 INFO L226 Difference]: Without dead ends: 372 [2023-11-28 20:39:42,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:39:42,722 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 489 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:42,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 546 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-28 20:39:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-11-28 20:39:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 297. [2023-11-28 20:39:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 251 states have (on average 1.4223107569721116) internal successors, (357), 252 states have internal predecessors, (357), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:39:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2023-11-28 20:39:42,768 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 148 [2023-11-28 20:39:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:42,769 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2023-11-28 20:39:42,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:39:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2023-11-28 20:39:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:39:42,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:42,772 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:42,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:39:42,772 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:42,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash -305720285, now seen corresponding path program 1 times [2023-11-28 20:39:42,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:42,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100937143] [2023-11-28 20:39:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100937143] [2023-11-28 20:39:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100937143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:39:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493478756] [2023-11-28 20:39:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:42,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:39:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:39:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:42,953 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:43,027 INFO L93 Difference]: Finished difference Result 526 states and 782 transitions. [2023-11-28 20:39:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-11-28 20:39:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:43,030 INFO L225 Difference]: With dead ends: 526 [2023-11-28 20:39:43,030 INFO L226 Difference]: Without dead ends: 329 [2023-11-28 20:39:43,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-28 20:39:43,032 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 58 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:43,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 667 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:39:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-11-28 20:39:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 303. [2023-11-28 20:39:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 257 states have (on average 1.4124513618677044) internal successors, (363), 258 states have internal predecessors, (363), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:39:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 447 transitions. [2023-11-28 20:39:43,072 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 447 transitions. Word has length 148 [2023-11-28 20:39:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:43,072 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 447 transitions. [2023-11-28 20:39:43,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:39:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 447 transitions. [2023-11-28 20:39:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:39:43,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:43,074 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:43,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:39:43,074 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:43,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1737981268, now seen corresponding path program 1 times [2023-11-28 20:39:43,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:43,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757643104] [2023-11-28 20:39:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:43,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757643104] [2023-11-28 20:39:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757643104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-28 20:39:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706850515] [2023-11-28 20:39:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:46,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:39:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:46,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:39:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:39:46,814 INFO L87 Difference]: Start difference. First operand 303 states and 447 transitions. Second operand has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:39:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:49,952 INFO L93 Difference]: Finished difference Result 788 states and 1160 transitions. [2023-11-28 20:39:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-28 20:39:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:39:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:49,956 INFO L225 Difference]: With dead ends: 788 [2023-11-28 20:39:49,956 INFO L226 Difference]: Without dead ends: 585 [2023-11-28 20:39:49,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2023-11-28 20:39:49,958 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 660 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:49,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1125 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-28 20:39:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-11-28 20:39:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 303. [2023-11-28 20:39:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 257 states have (on average 1.4085603112840468) internal successors, (362), 258 states have internal predecessors, (362), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:39:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 446 transitions. [2023-11-28 20:39:50,011 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 446 transitions. Word has length 148 [2023-11-28 20:39:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:50,011 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 446 transitions. [2023-11-28 20:39:50,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:39:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 446 transitions. [2023-11-28 20:39:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:39:50,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:50,013 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:50,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:39:50,013 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:50,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1424065250, now seen corresponding path program 1 times [2023-11-28 20:39:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:50,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099434419] [2023-11-28 20:39:50,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:50,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:51,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:51,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099434419] [2023-11-28 20:39:51,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099434419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:51,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:51,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:39:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940448171] [2023-11-28 20:39:51,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:51,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:39:51,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:51,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:39:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:39:51,093 INFO L87 Difference]: Start difference. First operand 303 states and 446 transitions. Second operand has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:39:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:51,702 INFO L93 Difference]: Finished difference Result 509 states and 748 transitions. [2023-11-28 20:39:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:39:51,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:39:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:51,707 INFO L225 Difference]: With dead ends: 509 [2023-11-28 20:39:51,707 INFO L226 Difference]: Without dead ends: 306 [2023-11-28 20:39:51,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:39:51,709 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 154 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:51,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 431 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:39:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-11-28 20:39:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2023-11-28 20:39:51,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 257 states have (on average 1.404669260700389) internal successors, (361), 258 states have internal predecessors, (361), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:39:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 445 transitions. [2023-11-28 20:39:51,757 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 445 transitions. Word has length 148 [2023-11-28 20:39:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:51,758 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 445 transitions. [2023-11-28 20:39:51,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 8 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:39:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 445 transitions. [2023-11-28 20:39:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:39:51,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:51,759 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:51,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:39:51,760 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:51,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1564613860, now seen corresponding path program 1 times [2023-11-28 20:39:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194584633] [2023-11-28 20:39:51,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:39:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:39:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:39:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:39:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:39:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:39:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:39:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:39:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:39:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:39:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:39:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:39:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:39:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:39:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:39:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:39:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:39:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:39:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:39:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:39:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:39:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194584633] [2023-11-28 20:39:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194584633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:55,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-28 20:39:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525179675] [2023-11-28 20:39:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:55,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:39:55,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:55,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:39:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:39:55,477 INFO L87 Difference]: Start difference. First operand 303 states and 445 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:39:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:58,210 INFO L93 Difference]: Finished difference Result 676 states and 992 transitions. [2023-11-28 20:39:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:39:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-11-28 20:39:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:58,214 INFO L225 Difference]: With dead ends: 676 [2023-11-28 20:39:58,214 INFO L226 Difference]: Without dead ends: 473 [2023-11-28 20:39:58,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2023-11-28 20:39:58,216 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 693 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:58,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1075 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 20:39:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-11-28 20:39:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 325. [2023-11-28 20:39:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 279 states have (on average 1.4086021505376345) internal successors, (393), 280 states have internal predecessors, (393), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:39:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 477 transitions. [2023-11-28 20:39:58,268 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 477 transitions. Word has length 148 [2023-11-28 20:39:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:58,269 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 477 transitions. [2023-11-28 20:39:58,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:39:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 477 transitions. [2023-11-28 20:39:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:39:58,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:58,271 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:39:58,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:39:58,271 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:39:58,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1386709806, now seen corresponding path program 1 times [2023-11-28 20:39:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:39:58,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927133007] [2023-11-28 20:39:58,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:58,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:39:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:01,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:01,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927133007] [2023-11-28 20:40:01,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927133007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:01,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:01,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-28 20:40:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040088836] [2023-11-28 20:40:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:01,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 20:40:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:01,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 20:40:01,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:40:01,143 INFO L87 Difference]: Start difference. First operand 325 states and 477 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:40:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:03,760 INFO L93 Difference]: Finished difference Result 707 states and 1037 transitions. [2023-11-28 20:40:03,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:40:03,761 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-11-28 20:40:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:03,764 INFO L225 Difference]: With dead ends: 707 [2023-11-28 20:40:03,764 INFO L226 Difference]: Without dead ends: 504 [2023-11-28 20:40:03,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2023-11-28 20:40:03,766 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 681 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:03,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1226 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 20:40:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2023-11-28 20:40:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 326. [2023-11-28 20:40:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 280 states have (on average 1.4071428571428573) internal successors, (394), 281 states have internal predecessors, (394), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:40:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 478 transitions. [2023-11-28 20:40:03,828 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 478 transitions. Word has length 148 [2023-11-28 20:40:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:03,829 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 478 transitions. [2023-11-28 20:40:03,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:40:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 478 transitions. [2023-11-28 20:40:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:03,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:03,830 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:03,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:40:03,831 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:03,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash 375592556, now seen corresponding path program 1 times [2023-11-28 20:40:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:03,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144069548] [2023-11-28 20:40:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:04,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144069548] [2023-11-28 20:40:04,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144069548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:40:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726969240] [2023-11-28 20:40:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:04,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:40:04,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:40:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:40:04,071 INFO L87 Difference]: Start difference. First operand 326 states and 478 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:40:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:04,380 INFO L93 Difference]: Finished difference Result 680 states and 994 transitions. [2023-11-28 20:40:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:40:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2023-11-28 20:40:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:04,383 INFO L225 Difference]: With dead ends: 680 [2023-11-28 20:40:04,383 INFO L226 Difference]: Without dead ends: 477 [2023-11-28 20:40:04,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:40:04,385 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 227 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:04,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 522 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:40:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2023-11-28 20:40:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 328. [2023-11-28 20:40:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 282 states have (on average 1.4078014184397163) internal successors, (397), 283 states have internal predecessors, (397), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:40:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 481 transitions. [2023-11-28 20:40:04,437 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 481 transitions. Word has length 148 [2023-11-28 20:40:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:04,438 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 481 transitions. [2023-11-28 20:40:04,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:40:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 481 transitions. [2023-11-28 20:40:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:04,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:04,440 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:04,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:40:04,440 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:04,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash 633757994, now seen corresponding path program 1 times [2023-11-28 20:40:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:04,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656904267] [2023-11-28 20:40:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:07,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:07,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656904267] [2023-11-28 20:40:07,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656904267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:07,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:07,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-28 20:40:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801241387] [2023-11-28 20:40:07,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:07,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 20:40:07,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:07,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 20:40:07,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:40:07,533 INFO L87 Difference]: Start difference. First operand 328 states and 481 transitions. Second operand has 15 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:09,857 INFO L93 Difference]: Finished difference Result 756 states and 1103 transitions. [2023-11-28 20:40:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:40:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:40:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:09,862 INFO L225 Difference]: With dead ends: 756 [2023-11-28 20:40:09,862 INFO L226 Difference]: Without dead ends: 547 [2023-11-28 20:40:09,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2023-11-28 20:40:09,864 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 548 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:09,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1106 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-28 20:40:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2023-11-28 20:40:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 352. [2023-11-28 20:40:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 305 states have (on average 1.4065573770491804) internal successors, (429), 306 states have internal predecessors, (429), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:40:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 513 transitions. [2023-11-28 20:40:09,915 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 513 transitions. Word has length 148 [2023-11-28 20:40:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:09,915 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 513 transitions. [2023-11-28 20:40:09,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 15 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 513 transitions. [2023-11-28 20:40:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:09,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:09,917 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:09,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:40:09,918 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:09,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash -757328222, now seen corresponding path program 1 times [2023-11-28 20:40:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120159507] [2023-11-28 20:40:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:09,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120159507] [2023-11-28 20:40:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120159507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:13,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:13,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-28 20:40:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371100782] [2023-11-28 20:40:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:13,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:40:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:40:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:40:13,675 INFO L87 Difference]: Start difference. First operand 352 states and 513 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:16,540 INFO L93 Difference]: Finished difference Result 694 states and 1012 transitions. [2023-11-28 20:40:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:40:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:40:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:16,543 INFO L225 Difference]: With dead ends: 694 [2023-11-28 20:40:16,543 INFO L226 Difference]: Without dead ends: 489 [2023-11-28 20:40:16,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2023-11-28 20:40:16,544 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 579 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:16,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1168 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 20:40:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-11-28 20:40:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 353. [2023-11-28 20:40:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 306 states have (on average 1.4052287581699345) internal successors, (430), 307 states have internal predecessors, (430), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:40:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 514 transitions. [2023-11-28 20:40:16,589 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 514 transitions. Word has length 148 [2023-11-28 20:40:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:16,590 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 514 transitions. [2023-11-28 20:40:16,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 514 transitions. [2023-11-28 20:40:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:16,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:16,591 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:16,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:40:16,592 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:16,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1842776314, now seen corresponding path program 1 times [2023-11-28 20:40:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:16,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543302647] [2023-11-28 20:40:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543302647] [2023-11-28 20:40:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543302647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:19,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:19,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-28 20:40:19,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980705734] [2023-11-28 20:40:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:19,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:40:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:19,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:40:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:40:19,905 INFO L87 Difference]: Start difference. First operand 353 states and 514 transitions. Second operand has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:22,882 INFO L93 Difference]: Finished difference Result 673 states and 983 transitions. [2023-11-28 20:40:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:40:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:40:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:22,885 INFO L225 Difference]: With dead ends: 673 [2023-11-28 20:40:22,885 INFO L226 Difference]: Without dead ends: 468 [2023-11-28 20:40:22,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2023-11-28 20:40:22,887 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 762 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:22,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1187 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 20:40:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-28 20:40:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 377. [2023-11-28 20:40:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 330 states have (on average 1.415151515151515) internal successors, (467), 331 states have internal predecessors, (467), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:40:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 551 transitions. [2023-11-28 20:40:22,944 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 551 transitions. Word has length 148 [2023-11-28 20:40:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:22,944 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 551 transitions. [2023-11-28 20:40:22,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 551 transitions. [2023-11-28 20:40:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:22,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:22,946 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:22,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:40:22,946 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:22,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:22,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1751126404, now seen corresponding path program 1 times [2023-11-28 20:40:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778551366] [2023-11-28 20:40:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:25,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:25,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778551366] [2023-11-28 20:40:25,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778551366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:25,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:25,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:40:25,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762321938] [2023-11-28 20:40:25,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:25,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:40:25,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:25,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:40:25,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:40:25,613 INFO L87 Difference]: Start difference. First operand 377 states and 551 transitions. Second operand has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:27,202 INFO L93 Difference]: Finished difference Result 708 states and 1034 transitions. [2023-11-28 20:40:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:40:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:40:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:27,206 INFO L225 Difference]: With dead ends: 708 [2023-11-28 20:40:27,206 INFO L226 Difference]: Without dead ends: 477 [2023-11-28 20:40:27,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:40:27,208 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 555 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:27,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 682 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-28 20:40:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2023-11-28 20:40:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 446. [2023-11-28 20:40:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 392 states have (on average 1.4107142857142858) internal successors, (553), 394 states have internal predecessors, (553), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 649 transitions. [2023-11-28 20:40:27,281 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 649 transitions. Word has length 148 [2023-11-28 20:40:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:27,282 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 649 transitions. [2023-11-28 20:40:27,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 649 transitions. [2023-11-28 20:40:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:27,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:27,283 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:27,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 20:40:27,284 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:27,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1255970300, now seen corresponding path program 1 times [2023-11-28 20:40:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:27,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752360128] [2023-11-28 20:40:27,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:29,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:29,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752360128] [2023-11-28 20:40:29,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752360128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:29,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:29,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:40:29,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843925767] [2023-11-28 20:40:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:29,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:40:29,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:40:29,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:40:29,864 INFO L87 Difference]: Start difference. First operand 446 states and 649 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:30,821 INFO L93 Difference]: Finished difference Result 886 states and 1292 transitions. [2023-11-28 20:40:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:40:30,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:40:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:30,826 INFO L225 Difference]: With dead ends: 886 [2023-11-28 20:40:30,826 INFO L226 Difference]: Without dead ends: 588 [2023-11-28 20:40:30,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:40:30,827 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 469 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:30,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 432 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:40:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2023-11-28 20:40:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 465. [2023-11-28 20:40:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 411 states have (on average 1.413625304136253) internal successors, (581), 413 states have internal predecessors, (581), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 677 transitions. [2023-11-28 20:40:30,876 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 677 transitions. Word has length 148 [2023-11-28 20:40:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:30,877 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 677 transitions. [2023-11-28 20:40:30,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 677 transitions. [2023-11-28 20:40:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:30,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:30,878 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:30,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 20:40:30,878 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:30,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1983324924, now seen corresponding path program 1 times [2023-11-28 20:40:30,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:30,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487247776] [2023-11-28 20:40:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:33,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487247776] [2023-11-28 20:40:33,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487247776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:33,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:33,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-28 20:40:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704345130] [2023-11-28 20:40:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:33,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:40:33,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:40:33,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:40:33,565 INFO L87 Difference]: Start difference. First operand 465 states and 677 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:40:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:35,023 INFO L93 Difference]: Finished difference Result 839 states and 1217 transitions. [2023-11-28 20:40:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:40:35,024 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 148 [2023-11-28 20:40:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:35,027 INFO L225 Difference]: With dead ends: 839 [2023-11-28 20:40:35,027 INFO L226 Difference]: Without dead ends: 522 [2023-11-28 20:40:35,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:40:35,028 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 333 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:35,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 494 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 20:40:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-11-28 20:40:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 473. [2023-11-28 20:40:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 418 states have (on average 1.4090909090909092) internal successors, (589), 420 states have internal predecessors, (589), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 685 transitions. [2023-11-28 20:40:35,113 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 685 transitions. Word has length 148 [2023-11-28 20:40:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:35,113 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 685 transitions. [2023-11-28 20:40:35,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:40:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 685 transitions. [2023-11-28 20:40:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:35,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:35,115 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:35,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 20:40:35,116 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:35,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1610577794, now seen corresponding path program 1 times [2023-11-28 20:40:35,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:35,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374267832] [2023-11-28 20:40:35,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:35,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:38,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:38,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374267832] [2023-11-28 20:40:38,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374267832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:38,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:38,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-28 20:40:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721595118] [2023-11-28 20:40:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:38,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-28 20:40:38,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-28 20:40:38,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2023-11-28 20:40:38,595 INFO L87 Difference]: Start difference. First operand 473 states and 685 transitions. Second operand has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:40:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:41,519 INFO L93 Difference]: Finished difference Result 829 states and 1202 transitions. [2023-11-28 20:40:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-28 20:40:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 148 [2023-11-28 20:40:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:41,523 INFO L225 Difference]: With dead ends: 829 [2023-11-28 20:40:41,523 INFO L226 Difference]: Without dead ends: 508 [2023-11-28 20:40:41,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2023-11-28 20:40:41,524 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 482 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 2027 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:41,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1245 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2027 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 20:40:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-11-28 20:40:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 475. [2023-11-28 20:40:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 420 states have (on average 1.4071428571428573) internal successors, (591), 422 states have internal predecessors, (591), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 687 transitions. [2023-11-28 20:40:41,591 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 687 transitions. Word has length 148 [2023-11-28 20:40:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:41,591 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 687 transitions. [2023-11-28 20:40:41,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:40:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 687 transitions. [2023-11-28 20:40:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:41,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:41,593 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:41,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-28 20:40:41,593 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:41,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash -528962948, now seen corresponding path program 1 times [2023-11-28 20:40:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976303764] [2023-11-28 20:40:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:43,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:44,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:44,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:44,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:44,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976303764] [2023-11-28 20:40:44,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976303764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:44,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:44,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:40:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353555932] [2023-11-28 20:40:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:44,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:40:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:40:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:40:44,015 INFO L87 Difference]: Start difference. First operand 475 states and 687 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:40:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:45,103 INFO L93 Difference]: Finished difference Result 858 states and 1244 transitions. [2023-11-28 20:40:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:40:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-11-28 20:40:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:45,107 INFO L225 Difference]: With dead ends: 858 [2023-11-28 20:40:45,107 INFO L226 Difference]: Without dead ends: 535 [2023-11-28 20:40:45,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:40:45,109 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 475 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:45,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 527 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 20:40:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2023-11-28 20:40:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 475. [2023-11-28 20:40:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 420 states have (on average 1.4023809523809523) internal successors, (589), 422 states have internal predecessors, (589), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 685 transitions. [2023-11-28 20:40:45,193 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 685 transitions. Word has length 148 [2023-11-28 20:40:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:45,194 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 685 transitions. [2023-11-28 20:40:45,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:40:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 685 transitions. [2023-11-28 20:40:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:45,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:45,195 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:45,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-28 20:40:45,196 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:45,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1115768962, now seen corresponding path program 1 times [2023-11-28 20:40:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:45,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326191193] [2023-11-28 20:40:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:48,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:48,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326191193] [2023-11-28 20:40:48,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326191193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:48,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:48,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-28 20:40:48,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180075958] [2023-11-28 20:40:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:48,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-28 20:40:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-28 20:40:48,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:40:48,626 INFO L87 Difference]: Start difference. First operand 475 states and 685 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:40:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:50,922 INFO L93 Difference]: Finished difference Result 831 states and 1200 transitions. [2023-11-28 20:40:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:40:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2023-11-28 20:40:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:50,925 INFO L225 Difference]: With dead ends: 831 [2023-11-28 20:40:50,925 INFO L226 Difference]: Without dead ends: 508 [2023-11-28 20:40:50,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2023-11-28 20:40:50,926 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 456 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:50,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1157 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-28 20:40:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-11-28 20:40:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 473. [2023-11-28 20:40:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 418 states have (on average 1.4043062200956937) internal successors, (587), 420 states have internal predecessors, (587), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 683 transitions. [2023-11-28 20:40:50,987 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 683 transitions. Word has length 148 [2023-11-28 20:40:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:50,987 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 683 transitions. [2023-11-28 20:40:50,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:40:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 683 transitions. [2023-11-28 20:40:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-28 20:40:50,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:50,988 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:50,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-28 20:40:50,988 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:50,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash -274155774, now seen corresponding path program 1 times [2023-11-28 20:40:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291944741] [2023-11-28 20:40:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:54,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:54,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291944741] [2023-11-28 20:40:54,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291944741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:54,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:54,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-28 20:40:54,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636177893] [2023-11-28 20:40:54,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:54,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:40:54,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:54,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:40:54,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:40:54,276 INFO L87 Difference]: Start difference. First operand 473 states and 683 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:56,907 INFO L93 Difference]: Finished difference Result 824 states and 1192 transitions. [2023-11-28 20:40:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:40:56,908 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2023-11-28 20:40:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:56,911 INFO L225 Difference]: With dead ends: 824 [2023-11-28 20:40:56,911 INFO L226 Difference]: Without dead ends: 503 [2023-11-28 20:40:56,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2023-11-28 20:40:56,914 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 357 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:56,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1210 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-28 20:40:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-11-28 20:40:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 468. [2023-11-28 20:40:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 413 states have (on average 1.4067796610169492) internal successors, (581), 415 states have internal predecessors, (581), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 677 transitions. [2023-11-28 20:40:57,000 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 677 transitions. Word has length 148 [2023-11-28 20:40:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:57,000 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 677 transitions. [2023-11-28 20:40:57,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 677 transitions. [2023-11-28 20:40:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-28 20:40:57,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:57,003 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:57,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-28 20:40:57,003 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:57,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash -601000487, now seen corresponding path program 1 times [2023-11-28 20:40:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:57,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326334597] [2023-11-28 20:40:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326334597] [2023-11-28 20:40:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326334597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:57,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:40:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208658475] [2023-11-28 20:40:57,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:57,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:40:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:57,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:40:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:40:57,235 INFO L87 Difference]: Start difference. First operand 468 states and 677 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:40:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:57,318 INFO L93 Difference]: Finished difference Result 818 states and 1180 transitions. [2023-11-28 20:40:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:40:57,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2023-11-28 20:40:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:57,320 INFO L225 Difference]: With dead ends: 818 [2023-11-28 20:40:57,320 INFO L226 Difference]: Without dead ends: 468 [2023-11-28 20:40:57,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:40:57,321 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:57,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 480 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:40:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-28 20:40:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2023-11-28 20:40:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 413 states have (on average 1.3583535108958837) internal successors, (561), 415 states have internal predecessors, (561), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 657 transitions. [2023-11-28 20:40:57,373 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 657 transitions. Word has length 149 [2023-11-28 20:40:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:57,373 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 657 transitions. [2023-11-28 20:40:57,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:40:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 657 transitions. [2023-11-28 20:40:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-28 20:40:57,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:57,375 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:57,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-28 20:40:57,375 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:57,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:57,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1393144219, now seen corresponding path program 1 times [2023-11-28 20:40:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:57,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75419579] [2023-11-28 20:40:57,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:40:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:40:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:40:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:40:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:40:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:40:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:40:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:40:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:40:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:40:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:40:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:40:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:40:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:40:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:40:58,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:58,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75419579] [2023-11-28 20:40:58,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75419579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:58,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:58,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:40:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857674232] [2023-11-28 20:40:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:58,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:40:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:40:58,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:40:58,788 INFO L87 Difference]: Start difference. First operand 468 states and 657 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:59,517 INFO L93 Difference]: Finished difference Result 1061 states and 1498 transitions. [2023-11-28 20:40:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:40:59,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2023-11-28 20:40:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:59,520 INFO L225 Difference]: With dead ends: 1061 [2023-11-28 20:40:59,520 INFO L226 Difference]: Without dead ends: 745 [2023-11-28 20:40:59,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:40:59,521 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 329 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:59,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 395 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:40:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-11-28 20:40:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 588. [2023-11-28 20:40:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 533 states have (on average 1.3902439024390243) internal successors, (741), 535 states have internal predecessors, (741), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:40:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 837 transitions. [2023-11-28 20:40:59,593 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 837 transitions. Word has length 149 [2023-11-28 20:40:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:59,594 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 837 transitions. [2023-11-28 20:40:59,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:40:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 837 transitions. [2023-11-28 20:40:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-28 20:40:59,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:59,596 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:40:59,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-28 20:40:59,596 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:59,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1259130713, now seen corresponding path program 1 times [2023-11-28 20:40:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:59,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477103824] [2023-11-28 20:40:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:03,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477103824] [2023-11-28 20:41:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477103824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:03,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-28 20:41:03,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162968309] [2023-11-28 20:41:03,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:03,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:41:03,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:41:03,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:41:03,063 INFO L87 Difference]: Start difference. First operand 588 states and 837 transitions. Second operand has 21 states, 19 states have (on average 3.0) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:06,383 INFO L93 Difference]: Finished difference Result 1357 states and 1940 transitions. [2023-11-28 20:41:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:41:06,384 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.0) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2023-11-28 20:41:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:06,387 INFO L225 Difference]: With dead ends: 1357 [2023-11-28 20:41:06,387 INFO L226 Difference]: Without dead ends: 969 [2023-11-28 20:41:06,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2023-11-28 20:41:06,389 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 756 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:06,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1208 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-28 20:41:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2023-11-28 20:41:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 592. [2023-11-28 20:41:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 537 states have (on average 1.3910614525139664) internal successors, (747), 539 states have internal predecessors, (747), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 843 transitions. [2023-11-28 20:41:06,448 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 843 transitions. Word has length 149 [2023-11-28 20:41:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:06,448 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 843 transitions. [2023-11-28 20:41:06,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.0) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 843 transitions. [2023-11-28 20:41:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-28 20:41:06,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:06,449 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:06,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-28 20:41:06,449 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:06,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1517296151, now seen corresponding path program 1 times [2023-11-28 20:41:06,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:06,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599535193] [2023-11-28 20:41:06,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:06,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:07,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:07,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599535193] [2023-11-28 20:41:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599535193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:07,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-28 20:41:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615250592] [2023-11-28 20:41:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:07,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 20:41:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 20:41:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:41:07,398 INFO L87 Difference]: Start difference. First operand 592 states and 843 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:08,810 INFO L93 Difference]: Finished difference Result 1377 states and 1962 transitions. [2023-11-28 20:41:08,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-28 20:41:08,810 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2023-11-28 20:41:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:08,814 INFO L225 Difference]: With dead ends: 1377 [2023-11-28 20:41:08,814 INFO L226 Difference]: Without dead ends: 989 [2023-11-28 20:41:08,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2023-11-28 20:41:08,815 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 758 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:08,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1390 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:41:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2023-11-28 20:41:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 598. [2023-11-28 20:41:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 543 states have (on average 1.3941068139963169) internal successors, (757), 545 states have internal predecessors, (757), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 853 transitions. [2023-11-28 20:41:08,886 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 853 transitions. Word has length 149 [2023-11-28 20:41:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:08,886 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 853 transitions. [2023-11-28 20:41:08,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 853 transitions. [2023-11-28 20:41:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-28 20:41:08,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:08,888 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:08,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-28 20:41:08,889 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:08,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash -51704952, now seen corresponding path program 1 times [2023-11-28 20:41:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701608105] [2023-11-28 20:41:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:10,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:10,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701608105] [2023-11-28 20:41:10,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701608105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:10,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:10,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-28 20:41:10,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871832394] [2023-11-28 20:41:10,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:10,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-28 20:41:10,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:10,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 20:41:10,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:41:10,639 INFO L87 Difference]: Start difference. First operand 598 states and 853 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:41:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:12,166 INFO L93 Difference]: Finished difference Result 1212 states and 1717 transitions. [2023-11-28 20:41:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-28 20:41:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2023-11-28 20:41:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:12,170 INFO L225 Difference]: With dead ends: 1212 [2023-11-28 20:41:12,170 INFO L226 Difference]: Without dead ends: 824 [2023-11-28 20:41:12,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2023-11-28 20:41:12,171 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 653 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:12,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 661 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 20:41:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2023-11-28 20:41:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 717. [2023-11-28 20:41:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 662 states have (on average 1.3610271903323263) internal successors, (901), 664 states have internal predecessors, (901), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 997 transitions. [2023-11-28 20:41:12,231 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 997 transitions. Word has length 150 [2023-11-28 20:41:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:12,231 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 997 transitions. [2023-11-28 20:41:12,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:41:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 997 transitions. [2023-11-28 20:41:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-28 20:41:12,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:12,233 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:12,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-28 20:41:12,233 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:12,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2048668353, now seen corresponding path program 1 times [2023-11-28 20:41:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:12,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000545758] [2023-11-28 20:41:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000545758] [2023-11-28 20:41:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000545758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:12,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:12,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:41:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618614857] [2023-11-28 20:41:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:12,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:41:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:41:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:41:12,808 INFO L87 Difference]: Start difference. First operand 717 states and 997 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:13,302 INFO L93 Difference]: Finished difference Result 1290 states and 1802 transitions. [2023-11-28 20:41:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:41:13,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-11-28 20:41:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:13,306 INFO L225 Difference]: With dead ends: 1290 [2023-11-28 20:41:13,306 INFO L226 Difference]: Without dead ends: 809 [2023-11-28 20:41:13,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:41:13,307 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 410 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:13,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 409 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:41:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2023-11-28 20:41:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 717. [2023-11-28 20:41:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 662 states have (on average 1.3580060422960725) internal successors, (899), 664 states have internal predecessors, (899), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 995 transitions. [2023-11-28 20:41:13,368 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 995 transitions. Word has length 150 [2023-11-28 20:41:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:13,368 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 995 transitions. [2023-11-28 20:41:13,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 995 transitions. [2023-11-28 20:41:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-28 20:41:13,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:13,370 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:13,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-28 20:41:13,370 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:13,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 88843658, now seen corresponding path program 1 times [2023-11-28 20:41:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:13,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495750231] [2023-11-28 20:41:13,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:15,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:15,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495750231] [2023-11-28 20:41:15,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495750231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:15,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:15,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-11-28 20:41:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458161287] [2023-11-28 20:41:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:15,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-28 20:41:15,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:15,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-28 20:41:15,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:41:15,599 INFO L87 Difference]: Start difference. First operand 717 states and 995 transitions. Second operand has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:19,165 INFO L93 Difference]: Finished difference Result 1609 states and 2243 transitions. [2023-11-28 20:41:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 20:41:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2023-11-28 20:41:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:19,169 INFO L225 Difference]: With dead ends: 1609 [2023-11-28 20:41:19,169 INFO L226 Difference]: Without dead ends: 1128 [2023-11-28 20:41:19,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2023-11-28 20:41:19,171 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 1160 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:19,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1319 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 20:41:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2023-11-28 20:41:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 746. [2023-11-28 20:41:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 691 states have (on average 1.357452966714906) internal successors, (938), 693 states have internal predecessors, (938), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1034 transitions. [2023-11-28 20:41:19,235 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1034 transitions. Word has length 150 [2023-11-28 20:41:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:19,235 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1034 transitions. [2023-11-28 20:41:19,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1034 transitions. [2023-11-28 20:41:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-28 20:41:19,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:19,237 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:19,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-28 20:41:19,238 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:19,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash -313000024, now seen corresponding path program 1 times [2023-11-28 20:41:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:19,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364414870] [2023-11-28 20:41:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:19,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:25,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:25,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:25,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:25,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364414870] [2023-11-28 20:41:25,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364414870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-11-28 20:41:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744144249] [2023-11-28 20:41:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:25,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-28 20:41:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-28 20:41:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2023-11-28 20:41:25,068 INFO L87 Difference]: Start difference. First operand 746 states and 1034 transitions. Second operand has 27 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:41:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:32,898 INFO L93 Difference]: Finished difference Result 1728 states and 2406 transitions. [2023-11-28 20:41:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-28 20:41:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 150 [2023-11-28 20:41:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:32,903 INFO L225 Difference]: With dead ends: 1728 [2023-11-28 20:41:32,903 INFO L226 Difference]: Without dead ends: 1247 [2023-11-28 20:41:32,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=609, Invalid=2813, Unknown=0, NotChecked=0, Total=3422 [2023-11-28 20:41:32,905 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 1152 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:32,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 1914 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-28 20:41:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-11-28 20:41:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 795. [2023-11-28 20:41:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 740 states have (on average 1.3554054054054054) internal successors, (1003), 742 states have internal predecessors, (1003), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1099 transitions. [2023-11-28 20:41:32,970 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1099 transitions. Word has length 150 [2023-11-28 20:41:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:32,970 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 1099 transitions. [2023-11-28 20:41:32,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:41:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1099 transitions. [2023-11-28 20:41:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-28 20:41:32,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:32,971 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:32,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-28 20:41:32,972 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:32,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1425487656, now seen corresponding path program 1 times [2023-11-28 20:41:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:32,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007348845] [2023-11-28 20:41:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007348845] [2023-11-28 20:41:36,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007348845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:36,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:36,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-11-28 20:41:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422606412] [2023-11-28 20:41:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:36,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-28 20:41:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-28 20:41:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:41:36,239 INFO L87 Difference]: Start difference. First operand 795 states and 1099 transitions. Second operand has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:39,973 INFO L93 Difference]: Finished difference Result 1473 states and 2053 transitions. [2023-11-28 20:41:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:41:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2023-11-28 20:41:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:39,977 INFO L225 Difference]: With dead ends: 1473 [2023-11-28 20:41:39,978 INFO L226 Difference]: Without dead ends: 992 [2023-11-28 20:41:39,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2023-11-28 20:41:39,979 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 767 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:39,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1442 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 20:41:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2023-11-28 20:41:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 836. [2023-11-28 20:41:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 781 states have (on average 1.3623559539052497) internal successors, (1064), 783 states have internal predecessors, (1064), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1160 transitions. [2023-11-28 20:41:40,048 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1160 transitions. Word has length 150 [2023-11-28 20:41:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:40,048 INFO L495 AbstractCegarLoop]: Abstraction has 836 states and 1160 transitions. [2023-11-28 20:41:40,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.761904761904762) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1160 transitions. [2023-11-28 20:41:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-28 20:41:40,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:40,050 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:40,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-28 20:41:40,050 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:40,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1683653094, now seen corresponding path program 1 times [2023-11-28 20:41:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280718022] [2023-11-28 20:41:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:40,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:40,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280718022] [2023-11-28 20:41:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280718022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:40,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:41:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686145851] [2023-11-28 20:41:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:40,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:41:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:41:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:41:40,259 INFO L87 Difference]: Start difference. First operand 836 states and 1160 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:40,578 INFO L93 Difference]: Finished difference Result 1505 states and 2096 transitions. [2023-11-28 20:41:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:41:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-11-28 20:41:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:40,583 INFO L225 Difference]: With dead ends: 1505 [2023-11-28 20:41:40,583 INFO L226 Difference]: Without dead ends: 976 [2023-11-28 20:41:40,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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-28 20:41:40,584 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 139 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:40,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 530 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:41:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2023-11-28 20:41:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 833. [2023-11-28 20:41:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 778 states have (on average 1.3560411311053984) internal successors, (1055), 780 states have internal predecessors, (1055), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1151 transitions. [2023-11-28 20:41:40,649 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1151 transitions. Word has length 150 [2023-11-28 20:41:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:40,650 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 1151 transitions. [2023-11-28 20:41:40,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1151 transitions. [2023-11-28 20:41:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-28 20:41:40,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:40,651 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:40,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-28 20:41:40,651 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:40,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:40,652 INFO L85 PathProgramCache]: Analyzing trace with hash -946251606, now seen corresponding path program 1 times [2023-11-28 20:41:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:40,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107111613] [2023-11-28 20:41:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:40,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:41,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:41,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107111613] [2023-11-28 20:41:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107111613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:41,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:41,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:41:41,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151401003] [2023-11-28 20:41:41,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:41,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:41:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:41,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:41:41,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:41:41,202 INFO L87 Difference]: Start difference. First operand 833 states and 1151 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:41:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:41,643 INFO L93 Difference]: Finished difference Result 1362 states and 1890 transitions. [2023-11-28 20:41:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:41:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2023-11-28 20:41:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:41,647 INFO L225 Difference]: With dead ends: 1362 [2023-11-28 20:41:41,647 INFO L226 Difference]: Without dead ends: 795 [2023-11-28 20:41:41,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:41:41,648 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 143 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:41,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 396 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:41:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2023-11-28 20:41:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2023-11-28 20:41:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 740 states have (on average 1.3527027027027028) internal successors, (1001), 742 states have internal predecessors, (1001), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1097 transitions. [2023-11-28 20:41:41,713 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1097 transitions. Word has length 150 [2023-11-28 20:41:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:41,714 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 1097 transitions. [2023-11-28 20:41:41,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:41:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1097 transitions. [2023-11-28 20:41:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-28 20:41:41,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:41,715 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:41,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-28 20:41:41,715 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:41,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash 353090757, now seen corresponding path program 1 times [2023-11-28 20:41:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:41,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491937983] [2023-11-28 20:41:41,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:41,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491937983] [2023-11-28 20:41:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491937983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:42,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:41:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66311711] [2023-11-28 20:41:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:42,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:41:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:41:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:41:42,285 INFO L87 Difference]: Start difference. First operand 795 states and 1097 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:41:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:42,986 INFO L93 Difference]: Finished difference Result 1375 states and 1906 transitions. [2023-11-28 20:41:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:41:42,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2023-11-28 20:41:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:42,990 INFO L225 Difference]: With dead ends: 1375 [2023-11-28 20:41:42,990 INFO L226 Difference]: Without dead ends: 847 [2023-11-28 20:41:42,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:41:42,991 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 313 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:42,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 454 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:41:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2023-11-28 20:41:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 795. [2023-11-28 20:41:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 740 states have (on average 1.3513513513513513) internal successors, (1000), 742 states have internal predecessors, (1000), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1096 transitions. [2023-11-28 20:41:43,077 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1096 transitions. Word has length 150 [2023-11-28 20:41:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:43,077 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 1096 transitions. [2023-11-28 20:41:43,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:41:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1096 transitions. [2023-11-28 20:41:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:41:43,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:43,079 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:43,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-28 20:41:43,079 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:43,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1321675554, now seen corresponding path program 1 times [2023-11-28 20:41:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113756578] [2023-11-28 20:41:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113756578] [2023-11-28 20:41:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113756578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:43,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:41:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344009437] [2023-11-28 20:41:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:43,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:41:43,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:43,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:41:43,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:41:43,145 INFO L87 Difference]: Start difference. First operand 795 states and 1096 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:43,223 INFO L93 Difference]: Finished difference Result 1426 states and 1977 transitions. [2023-11-28 20:41:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:41:43,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-11-28 20:41:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:43,227 INFO L225 Difference]: With dead ends: 1426 [2023-11-28 20:41:43,227 INFO L226 Difference]: Without dead ends: 888 [2023-11-28 20:41:43,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-28 20:41:43,228 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:43,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 344 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:41:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2023-11-28 20:41:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 803. [2023-11-28 20:41:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 748 states have (on average 1.3475935828877006) internal successors, (1008), 750 states have internal predecessors, (1008), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1104 transitions. [2023-11-28 20:41:43,294 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1104 transitions. Word has length 151 [2023-11-28 20:41:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:43,294 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1104 transitions. [2023-11-28 20:41:43,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1104 transitions. [2023-11-28 20:41:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:41:43,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:43,296 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:43,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-28 20:41:43,296 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:43,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash -620610976, now seen corresponding path program 1 times [2023-11-28 20:41:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360217103] [2023-11-28 20:41:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360217103] [2023-11-28 20:41:43,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360217103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:43,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:43,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:41:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105046383] [2023-11-28 20:41:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:43,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:41:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:43,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:41:43,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:41:43,435 INFO L87 Difference]: Start difference. First operand 803 states and 1104 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:43,550 INFO L93 Difference]: Finished difference Result 1475 states and 2040 transitions. [2023-11-28 20:41:43,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:41:43,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-11-28 20:41:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:43,555 INFO L225 Difference]: With dead ends: 1475 [2023-11-28 20:41:43,555 INFO L226 Difference]: Without dead ends: 941 [2023-11-28 20:41:43,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:41:43,557 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 82 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:43,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 821 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:41:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2023-11-28 20:41:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 811. [2023-11-28 20:41:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 756 states have (on average 1.343915343915344) internal successors, (1016), 758 states have internal predecessors, (1016), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1112 transitions. [2023-11-28 20:41:43,624 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1112 transitions. Word has length 151 [2023-11-28 20:41:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:43,624 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1112 transitions. [2023-11-28 20:41:43,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:41:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1112 transitions. [2023-11-28 20:41:43,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:41:43,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:43,625 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:43,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-28 20:41:43,625 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:43,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2082693601, now seen corresponding path program 1 times [2023-11-28 20:41:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:43,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618384779] [2023-11-28 20:41:43,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618384779] [2023-11-28 20:41:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618384779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:46,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-28 20:41:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177032480] [2023-11-28 20:41:46,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:46,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-28 20:41:46,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-28 20:41:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:41:46,493 INFO L87 Difference]: Start difference. First operand 811 states and 1112 transitions. Second operand has 18 states, 16 states have (on average 3.6875) internal successors, (59), 18 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:49,480 INFO L93 Difference]: Finished difference Result 1443 states and 1980 transitions. [2023-11-28 20:41:49,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:41:49,480 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.6875) internal successors, (59), 18 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:41:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:49,485 INFO L225 Difference]: With dead ends: 1443 [2023-11-28 20:41:49,485 INFO L226 Difference]: Without dead ends: 902 [2023-11-28 20:41:49,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2023-11-28 20:41:49,487 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 502 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:49,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 921 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-28 20:41:49,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2023-11-28 20:41:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 811. [2023-11-28 20:41:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 756 states have (on average 1.343915343915344) internal successors, (1016), 758 states have internal predecessors, (1016), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1112 transitions. [2023-11-28 20:41:49,586 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1112 transitions. Word has length 151 [2023-11-28 20:41:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:49,586 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1112 transitions. [2023-11-28 20:41:49,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.6875) internal successors, (59), 18 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1112 transitions. [2023-11-28 20:41:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:41:49,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:49,587 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:49,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-28 20:41:49,587 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:49,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1459321883, now seen corresponding path program 1 times [2023-11-28 20:41:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205159525] [2023-11-28 20:41:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:41:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:41:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:41:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:41:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:41:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:41:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:41:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:41:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:41:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:41:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:41:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:41:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:41:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:41:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:41:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:41:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:41:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:41:52,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205159525] [2023-11-28 20:41:52,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205159525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:52,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:52,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-28 20:41:52,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161012793] [2023-11-28 20:41:52,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:52,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:41:52,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:52,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:41:52,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:41:52,503 INFO L87 Difference]: Start difference. First operand 811 states and 1112 transitions. Second operand has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:56,235 INFO L93 Difference]: Finished difference Result 1734 states and 2378 transitions. [2023-11-28 20:41:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:41:56,236 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:41:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:56,240 INFO L225 Difference]: With dead ends: 1734 [2023-11-28 20:41:56,240 INFO L226 Difference]: Without dead ends: 1194 [2023-11-28 20:41:56,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2023-11-28 20:41:56,242 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 623 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:56,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1392 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-28 20:41:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2023-11-28 20:41:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 811. [2023-11-28 20:41:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 756 states have (on average 1.3425925925925926) internal successors, (1015), 758 states have internal predecessors, (1015), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:41:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1111 transitions. [2023-11-28 20:41:56,316 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1111 transitions. Word has length 151 [2023-11-28 20:41:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:56,317 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1111 transitions. [2023-11-28 20:41:56,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:41:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1111 transitions. [2023-11-28 20:41:56,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:41:56,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:56,319 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:41:56,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-28 20:41:56,319 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:56,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1552925541, now seen corresponding path program 1 times [2023-11-28 20:41:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:56,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516711908] [2023-11-28 20:41:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516711908] [2023-11-28 20:42:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516711908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-11-28 20:42:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962543899] [2023-11-28 20:42:02,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:02,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-28 20:42:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:02,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-28 20:42:02,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:42:02,674 INFO L87 Difference]: Start difference. First operand 811 states and 1111 transitions. Second operand has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:42:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:07,477 INFO L93 Difference]: Finished difference Result 1769 states and 2424 transitions. [2023-11-28 20:42:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:42:07,477 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 151 [2023-11-28 20:42:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:07,480 INFO L225 Difference]: With dead ends: 1769 [2023-11-28 20:42:07,481 INFO L226 Difference]: Without dead ends: 1229 [2023-11-28 20:42:07,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=271, Invalid=1211, Unknown=0, NotChecked=0, Total=1482 [2023-11-28 20:42:07,482 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 887 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:07,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1460 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-28 20:42:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2023-11-28 20:42:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 816. [2023-11-28 20:42:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 761 states have (on average 1.340341655716163) internal successors, (1020), 763 states have internal predecessors, (1020), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:42:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1116 transitions. [2023-11-28 20:42:07,556 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1116 transitions. Word has length 151 [2023-11-28 20:42:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:07,556 INFO L495 AbstractCegarLoop]: Abstraction has 816 states and 1116 transitions. [2023-11-28 20:42:07,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:42:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1116 transitions. [2023-11-28 20:42:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:07,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:07,558 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:07,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-28 20:42:07,558 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:07,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2105325855, now seen corresponding path program 1 times [2023-11-28 20:42:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:07,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557763470] [2023-11-28 20:42:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:07,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:10,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:10,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557763470] [2023-11-28 20:42:10,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557763470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:10,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:10,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-28 20:42:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469023135] [2023-11-28 20:42:10,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:10,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:42:10,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:10,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:42:10,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:42:10,343 INFO L87 Difference]: Start difference. First operand 816 states and 1116 transitions. Second operand has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:13,435 INFO L93 Difference]: Finished difference Result 1769 states and 2424 transitions. [2023-11-28 20:42:13,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:42:13,436 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:42:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:13,438 INFO L225 Difference]: With dead ends: 1769 [2023-11-28 20:42:13,438 INFO L226 Difference]: Without dead ends: 1229 [2023-11-28 20:42:13,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2023-11-28 20:42:13,440 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 733 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:13,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1198 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-28 20:42:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2023-11-28 20:42:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 816. [2023-11-28 20:42:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 761 states have (on average 1.3390275952693824) internal successors, (1019), 763 states have internal predecessors, (1019), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-28 20:42:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1115 transitions. [2023-11-28 20:42:13,516 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1115 transitions. Word has length 151 [2023-11-28 20:42:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:13,516 INFO L495 AbstractCegarLoop]: Abstraction has 816 states and 1115 transitions. [2023-11-28 20:42:13,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1115 transitions. [2023-11-28 20:42:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:13,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:13,518 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:13,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-28 20:42:13,518 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:13,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1436689629, now seen corresponding path program 1 times [2023-11-28 20:42:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768754953] [2023-11-28 20:42:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:13,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:16,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768754953] [2023-11-28 20:42:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768754953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:16,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:16,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-28 20:42:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5861896] [2023-11-28 20:42:16,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:16,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-28 20:42:16,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:16,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-28 20:42:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2023-11-28 20:42:16,839 INFO L87 Difference]: Start difference. First operand 816 states and 1115 transitions. Second operand has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:19,674 INFO L93 Difference]: Finished difference Result 1860 states and 2547 transitions. [2023-11-28 20:42:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:42:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:42:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:19,677 INFO L225 Difference]: With dead ends: 1860 [2023-11-28 20:42:19,677 INFO L226 Difference]: Without dead ends: 1319 [2023-11-28 20:42:19,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2023-11-28 20:42:19,678 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 707 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:19,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1421 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-28 20:42:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2023-11-28 20:42:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 870. [2023-11-28 20:42:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 812 states have (on average 1.333743842364532) internal successors, (1083), 815 states have internal predecessors, (1083), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:42:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1183 transitions. [2023-11-28 20:42:19,758 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1183 transitions. Word has length 151 [2023-11-28 20:42:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:19,758 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1183 transitions. [2023-11-28 20:42:19,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1183 transitions. [2023-11-28 20:42:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:19,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:19,760 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:19,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-28 20:42:19,760 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:19,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1324250143, now seen corresponding path program 1 times [2023-11-28 20:42:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719542016] [2023-11-28 20:42:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:24,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719542016] [2023-11-28 20:42:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719542016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:24,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-28 20:42:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82549476] [2023-11-28 20:42:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:24,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:42:24,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:42:24,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:42:24,227 INFO L87 Difference]: Start difference. First operand 870 states and 1183 transitions. Second operand has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:27,222 INFO L93 Difference]: Finished difference Result 1851 states and 2531 transitions. [2023-11-28 20:42:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:42:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:42:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:27,225 INFO L225 Difference]: With dead ends: 1851 [2023-11-28 20:42:27,225 INFO L226 Difference]: Without dead ends: 1268 [2023-11-28 20:42:27,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=960, Unknown=0, NotChecked=0, Total=1190 [2023-11-28 20:42:27,226 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 604 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:27,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1171 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 20:42:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2023-11-28 20:42:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 870. [2023-11-28 20:42:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 812 states have (on average 1.332512315270936) internal successors, (1082), 815 states have internal predecessors, (1082), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:42:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1182 transitions. [2023-11-28 20:42:27,305 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1182 transitions. Word has length 151 [2023-11-28 20:42:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:27,306 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1182 transitions. [2023-11-28 20:42:27,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1182 transitions. [2023-11-28 20:42:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:27,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:27,307 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:27,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-28 20:42:27,307 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:27,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:27,307 INFO L85 PathProgramCache]: Analyzing trace with hash -71135917, now seen corresponding path program 1 times [2023-11-28 20:42:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:27,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627083457] [2023-11-28 20:42:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:27,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:30,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:30,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627083457] [2023-11-28 20:42:30,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627083457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:30,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:30,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-28 20:42:30,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501918431] [2023-11-28 20:42:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:30,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:42:30,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:30,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:42:30,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:42:30,596 INFO L87 Difference]: Start difference. First operand 870 states and 1182 transitions. Second operand has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:33,986 INFO L93 Difference]: Finished difference Result 1560 states and 2135 transitions. [2023-11-28 20:42:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-28 20:42:33,987 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:42:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:33,989 INFO L225 Difference]: With dead ends: 1560 [2023-11-28 20:42:33,989 INFO L226 Difference]: Without dead ends: 1020 [2023-11-28 20:42:33,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2023-11-28 20:42:33,991 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 638 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:33,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1415 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 20:42:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2023-11-28 20:42:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 877. [2023-11-28 20:42:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 819 states have (on average 1.332112332112332) internal successors, (1091), 822 states have internal predecessors, (1091), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:42:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1191 transitions. [2023-11-28 20:42:34,088 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1191 transitions. Word has length 151 [2023-11-28 20:42:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:34,088 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1191 transitions. [2023-11-28 20:42:34,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1191 transitions. [2023-11-28 20:42:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:34,090 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:34,090 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:34,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-28 20:42:34,090 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:34,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash 629928661, now seen corresponding path program 1 times [2023-11-28 20:42:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047842866] [2023-11-28 20:42:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:36,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:36,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047842866] [2023-11-28 20:42:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047842866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:36,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:42:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624542953] [2023-11-28 20:42:36,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:36,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:42:36,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:42:36,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:42:36,306 INFO L87 Difference]: Start difference. First operand 877 states and 1191 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:37,602 INFO L93 Difference]: Finished difference Result 1602 states and 2189 transitions. [2023-11-28 20:42:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:42:37,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:42:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:37,604 INFO L225 Difference]: With dead ends: 1602 [2023-11-28 20:42:37,604 INFO L226 Difference]: Without dead ends: 1055 [2023-11-28 20:42:37,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:42:37,605 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 443 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:37,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 629 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:42:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2023-11-28 20:42:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 883. [2023-11-28 20:42:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 825 states have (on average 1.3309090909090908) internal successors, (1098), 828 states have internal predecessors, (1098), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:42:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1198 transitions. [2023-11-28 20:42:37,689 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1198 transitions. Word has length 151 [2023-11-28 20:42:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:37,690 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1198 transitions. [2023-11-28 20:42:37,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1198 transitions. [2023-11-28 20:42:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:37,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:37,691 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:37,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-28 20:42:37,691 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:37,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash -657941931, now seen corresponding path program 1 times [2023-11-28 20:42:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:37,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121541079] [2023-11-28 20:42:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:39,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121541079] [2023-11-28 20:42:39,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121541079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:39,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:39,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:42:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047667363] [2023-11-28 20:42:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:39,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:42:39,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:39,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:42:39,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:42:39,958 INFO L87 Difference]: Start difference. First operand 883 states and 1198 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:42:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:41,038 INFO L93 Difference]: Finished difference Result 1612 states and 2199 transitions. [2023-11-28 20:42:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:42:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2023-11-28 20:42:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:41,040 INFO L225 Difference]: With dead ends: 1612 [2023-11-28 20:42:41,041 INFO L226 Difference]: Without dead ends: 1059 [2023-11-28 20:42:41,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:42:41,042 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 332 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:41,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 515 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 20:42:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2023-11-28 20:42:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 883. [2023-11-28 20:42:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 825 states have (on average 1.3296969696969696) internal successors, (1097), 828 states have internal predecessors, (1097), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:42:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1197 transitions. [2023-11-28 20:42:41,125 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1197 transitions. Word has length 151 [2023-11-28 20:42:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:41,125 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1197 transitions. [2023-11-28 20:42:41,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:42:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1197 transitions. [2023-11-28 20:42:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:41,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:41,127 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:41,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-11-28 20:42:41,127 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:41,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash -580609007, now seen corresponding path program 1 times [2023-11-28 20:42:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:41,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825029833] [2023-11-28 20:42:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:43,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825029833] [2023-11-28 20:42:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825029833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:43,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:42:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595005071] [2023-11-28 20:42:43,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:43,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:42:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:43,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:42:43,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:42:43,466 INFO L87 Difference]: Start difference. First operand 883 states and 1197 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:44,737 INFO L93 Difference]: Finished difference Result 1572 states and 2144 transitions. [2023-11-28 20:42:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:42:44,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:42:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:44,739 INFO L225 Difference]: With dead ends: 1572 [2023-11-28 20:42:44,739 INFO L226 Difference]: Without dead ends: 1019 [2023-11-28 20:42:44,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:42:44,740 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 507 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:44,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 667 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:42:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2023-11-28 20:42:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 882. [2023-11-28 20:42:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 824 states have (on average 1.328883495145631) internal successors, (1095), 827 states have internal predecessors, (1095), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:42:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1195 transitions. [2023-11-28 20:42:44,853 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1195 transitions. Word has length 151 [2023-11-28 20:42:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:44,853 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1195 transitions. [2023-11-28 20:42:44,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:42:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1195 transitions. [2023-11-28 20:42:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:44,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:44,854 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:44,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-11-28 20:42:44,854 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:44,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:44,855 INFO L85 PathProgramCache]: Analyzing trace with hash 120455571, now seen corresponding path program 1 times [2023-11-28 20:42:44,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:44,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73304924] [2023-11-28 20:42:44,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:44,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:49,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:49,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73304924] [2023-11-28 20:42:49,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73304924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:49,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:49,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-11-28 20:42:49,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707912393] [2023-11-28 20:42:49,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:49,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-28 20:42:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:49,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-28 20:42:49,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:42:49,588 INFO L87 Difference]: Start difference. First operand 882 states and 1195 transitions. Second operand has 23 states, 20 states have (on average 2.95) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:42:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:54,008 INFO L93 Difference]: Finished difference Result 1479 states and 2014 transitions. [2023-11-28 20:42:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-28 20:42:54,009 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.95) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 151 [2023-11-28 20:42:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:54,010 INFO L225 Difference]: With dead ends: 1479 [2023-11-28 20:42:54,010 INFO L226 Difference]: Without dead ends: 927 [2023-11-28 20:42:54,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2023-11-28 20:42:54,011 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 524 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:54,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1422 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-28 20:42:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2023-11-28 20:42:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 878. [2023-11-28 20:42:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 820 states have (on average 1.3304878048780489) internal successors, (1091), 823 states have internal predecessors, (1091), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:42:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1191 transitions. [2023-11-28 20:42:54,098 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1191 transitions. Word has length 151 [2023-11-28 20:42:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:54,098 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1191 transitions. [2023-11-28 20:42:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.95) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-28 20:42:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1191 transitions. [2023-11-28 20:42:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:54,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:54,100 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:54,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-11-28 20:42:54,100 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:54,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash -48503663, now seen corresponding path program 1 times [2023-11-28 20:42:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:54,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401813751] [2023-11-28 20:42:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:54,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:42:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:42:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:42:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:42:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:42:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:42:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:42:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:42:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:42:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:42:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:42:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:42:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:42:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:42:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:42:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:42:56,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401813751] [2023-11-28 20:42:56,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401813751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:56,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:56,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:42:56,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287604863] [2023-11-28 20:42:56,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:56,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:42:56,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:56,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:42:56,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:42:56,295 INFO L87 Difference]: Start difference. First operand 878 states and 1191 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:42:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:57,478 INFO L93 Difference]: Finished difference Result 1504 states and 2050 transitions. [2023-11-28 20:42:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:42:57,478 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2023-11-28 20:42:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:57,480 INFO L225 Difference]: With dead ends: 1504 [2023-11-28 20:42:57,480 INFO L226 Difference]: Without dead ends: 956 [2023-11-28 20:42:57,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:42:57,481 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 322 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:57,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 634 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 20:42:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2023-11-28 20:42:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 878. [2023-11-28 20:42:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 820 states have (on average 1.328048780487805) internal successors, (1089), 823 states have internal predecessors, (1089), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:42:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1189 transitions. [2023-11-28 20:42:57,568 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1189 transitions. Word has length 151 [2023-11-28 20:42:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:57,568 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1189 transitions. [2023-11-28 20:42:57,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:42:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1189 transitions. [2023-11-28 20:42:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:42:57,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:57,570 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:42:57,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-11-28 20:42:57,570 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:57,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash -635309677, now seen corresponding path program 1 times [2023-11-28 20:42:57,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:57,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017819375] [2023-11-28 20:42:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:57,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:43:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:43:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:43:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:43:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:43:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:43:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:43:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:43:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:43:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:43:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:43:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:43:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:43:01,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:01,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017819375] [2023-11-28 20:43:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017819375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-28 20:43:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018271621] [2023-11-28 20:43:01,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:01,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:43:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:43:01,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:43:01,344 INFO L87 Difference]: Start difference. First operand 878 states and 1189 transitions. Second operand has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:43:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:04,805 INFO L93 Difference]: Finished difference Result 1469 states and 2000 transitions. [2023-11-28 20:43:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-28 20:43:04,806 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:43:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:04,807 INFO L225 Difference]: With dead ends: 1469 [2023-11-28 20:43:04,807 INFO L226 Difference]: Without dead ends: 921 [2023-11-28 20:43:04,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2023-11-28 20:43:04,808 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 406 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:04,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1299 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2141 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-28 20:43:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2023-11-28 20:43:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 872. [2023-11-28 20:43:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 814 states have (on average 1.3304668304668306) internal successors, (1083), 817 states have internal predecessors, (1083), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:43:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1183 transitions. [2023-11-28 20:43:04,906 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1183 transitions. Word has length 151 [2023-11-28 20:43:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:04,906 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1183 transitions. [2023-11-28 20:43:04,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:43:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1183 transitions. [2023-11-28 20:43:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-28 20:43:04,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:04,908 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:43:04,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-11-28 20:43:04,908 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:04,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -443718189, now seen corresponding path program 1 times [2023-11-28 20:43:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:04,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340918664] [2023-11-28 20:43:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:43:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:43:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:43:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:43:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:43:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:43:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:43:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:43:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:43:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:43:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:43:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:43:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:43:09,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340918664] [2023-11-28 20:43:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340918664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:09,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-28 20:43:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901505846] [2023-11-28 20:43:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:09,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:43:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:43:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:43:09,689 INFO L87 Difference]: Start difference. First operand 872 states and 1183 transitions. Second operand has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:43:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:13,968 INFO L93 Difference]: Finished difference Result 1454 states and 1984 transitions. [2023-11-28 20:43:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-28 20:43:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2023-11-28 20:43:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:13,969 INFO L225 Difference]: With dead ends: 1454 [2023-11-28 20:43:13,969 INFO L226 Difference]: Without dead ends: 912 [2023-11-28 20:43:13,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2023-11-28 20:43:13,970 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 415 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:13,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1319 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-28 20:43:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2023-11-28 20:43:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 863. [2023-11-28 20:43:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 805 states have (on average 1.332919254658385) internal successors, (1073), 808 states have internal predecessors, (1073), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:43:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1173 transitions. [2023-11-28 20:43:14,057 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1173 transitions. Word has length 151 [2023-11-28 20:43:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:14,057 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1173 transitions. [2023-11-28 20:43:14,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:43:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1173 transitions. [2023-11-28 20:43:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-28 20:43:14,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:14,059 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:43:14,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-11-28 20:43:14,059 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:14,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1901482200, now seen corresponding path program 1 times [2023-11-28 20:43:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:14,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860589837] [2023-11-28 20:43:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:43:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:43:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:43:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:43:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:43:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:43:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:43:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:43:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:43:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:43:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:43:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:43:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:43:15,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:15,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860589837] [2023-11-28 20:43:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860589837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:15,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:15,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-28 20:43:15,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194203460] [2023-11-28 20:43:15,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:15,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-28 20:43:15,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:15,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 20:43:15,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:43:15,635 INFO L87 Difference]: Start difference. First operand 863 states and 1173 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:43:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:16,958 INFO L93 Difference]: Finished difference Result 1680 states and 2301 transitions. [2023-11-28 20:43:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:43:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2023-11-28 20:43:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:16,960 INFO L225 Difference]: With dead ends: 1680 [2023-11-28 20:43:16,960 INFO L226 Difference]: Without dead ends: 1125 [2023-11-28 20:43:16,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:43:16,961 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 510 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:16,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 759 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:43:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2023-11-28 20:43:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 938. [2023-11-28 20:43:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 880 states have (on average 1.3227272727272728) internal successors, (1164), 883 states have internal predecessors, (1164), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:43:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1264 transitions. [2023-11-28 20:43:17,056 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1264 transitions. Word has length 152 [2023-11-28 20:43:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:17,056 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1264 transitions. [2023-11-28 20:43:17,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-28 20:43:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1264 transitions. [2023-11-28 20:43:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-28 20:43:17,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:17,058 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:43:17,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-11-28 20:43:17,058 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:17,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1761097155, now seen corresponding path program 1 times [2023-11-28 20:43:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:17,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570991129] [2023-11-28 20:43:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:17,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:43:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:43:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:43:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:43:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:43:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:43:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:43:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:43:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:43:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:43:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:43:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:43:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:43:17,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:17,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570991129] [2023-11-28 20:43:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570991129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:17,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:17,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:43:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6321499] [2023-11-28 20:43:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:17,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:43:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:43:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:43:17,248 INFO L87 Difference]: Start difference. First operand 938 states and 1264 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:43:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:17,562 INFO L93 Difference]: Finished difference Result 2068 states and 2754 transitions. [2023-11-28 20:43:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:43:17,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-11-28 20:43:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:17,565 INFO L225 Difference]: With dead ends: 2068 [2023-11-28 20:43:17,565 INFO L226 Difference]: Without dead ends: 1413 [2023-11-28 20:43:17,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:43:17,566 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 93 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:17,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 490 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:43:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2023-11-28 20:43:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1124. [2023-11-28 20:43:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1066 states have (on average 1.2879924953095685) internal successors, (1373), 1069 states have internal predecessors, (1373), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:43:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1473 transitions. [2023-11-28 20:43:17,673 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1473 transitions. Word has length 153 [2023-11-28 20:43:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:17,673 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1473 transitions. [2023-11-28 20:43:17,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:43:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1473 transitions. [2023-11-28 20:43:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-28 20:43:17,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:17,674 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:43:17,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-11-28 20:43:17,675 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:17,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2089644285, now seen corresponding path program 1 times [2023-11-28 20:43:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52279005] [2023-11-28 20:43:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:43:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:43:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:43:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:43:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:43:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:43:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:43:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:43:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:43:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:43:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:43:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:43:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:43:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52279005] [2023-11-28 20:43:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52279005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:43:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183685345] [2023-11-28 20:43:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:17,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:43:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:17,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:43:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:43:17,741 INFO L87 Difference]: Start difference. First operand 1124 states and 1473 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:43:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:17,847 INFO L93 Difference]: Finished difference Result 1899 states and 2503 transitions. [2023-11-28 20:43:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:43:17,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-11-28 20:43:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:17,849 INFO L225 Difference]: With dead ends: 1899 [2023-11-28 20:43:17,849 INFO L226 Difference]: Without dead ends: 1136 [2023-11-28 20:43:17,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-28 20:43:17,850 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 10 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:17,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 316 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:43:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-11-28 20:43:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1128. [2023-11-28 20:43:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1070 states have (on average 1.2869158878504674) internal successors, (1377), 1073 states have internal predecessors, (1377), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:43:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1477 transitions. [2023-11-28 20:43:17,943 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1477 transitions. Word has length 153 [2023-11-28 20:43:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:17,943 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 1477 transitions. [2023-11-28 20:43:17,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:43:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1477 transitions. [2023-11-28 20:43:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-28 20:43:17,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:17,944 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:43:17,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-11-28 20:43:17,945 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:17,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:17,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2146902587, now seen corresponding path program 1 times [2023-11-28 20:43:17,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:17,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659726034] [2023-11-28 20:43:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:17,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:43:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:43:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:43:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:43:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:43:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:43:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:43:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:43:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:43:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:43:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:43:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:43:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:43:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659726034] [2023-11-28 20:43:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659726034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:18,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:43:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643244353] [2023-11-28 20:43:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:18,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:43:18,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:18,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:43:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:43:18,477 INFO L87 Difference]: Start difference. First operand 1128 states and 1477 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:43:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:19,080 INFO L93 Difference]: Finished difference Result 1907 states and 2432 transitions. [2023-11-28 20:43:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:43:19,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-11-28 20:43:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:19,083 INFO L225 Difference]: With dead ends: 1907 [2023-11-28 20:43:19,083 INFO L226 Difference]: Without dead ends: 1905 [2023-11-28 20:43:19,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2023-11-28 20:43:19,083 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 365 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:19,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 692 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:43:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2023-11-28 20:43:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1734. [2023-11-28 20:43:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1676 states have (on average 1.255966587112172) internal successors, (2105), 1679 states have internal predecessors, (2105), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:43:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2205 transitions. [2023-11-28 20:43:19,181 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2205 transitions. Word has length 153 [2023-11-28 20:43:19,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:19,181 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 2205 transitions. [2023-11-28 20:43:19,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:43:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2205 transitions. [2023-11-28 20:43:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-28 20:43:19,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:19,183 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:43:19,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-11-28 20:43:19,183 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:19,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1655006519, now seen corresponding path program 1 times [2023-11-28 20:43:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:19,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100605344] [2023-11-28 20:43:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:43:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:43:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:43:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:43:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:43:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:43:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:43:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:43:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:43:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:43:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:43:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:43:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:43:19,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:19,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100605344] [2023-11-28 20:43:19,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100605344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:19,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:19,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:43:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299662824] [2023-11-28 20:43:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:19,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:43:19,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:43:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:43:19,922 INFO L87 Difference]: Start difference. First operand 1734 states and 2205 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:43:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:20,672 INFO L93 Difference]: Finished difference Result 3619 states and 4621 transitions. [2023-11-28 20:43:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:43:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2023-11-28 20:43:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:20,676 INFO L225 Difference]: With dead ends: 3619 [2023-11-28 20:43:20,676 INFO L226 Difference]: Without dead ends: 2391 [2023-11-28 20:43:20,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:43:20,678 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 342 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:20,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 549 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:43:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2023-11-28 20:43:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 1950. [2023-11-28 20:43:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1892 states have (on average 1.2373150105708246) internal successors, (2341), 1895 states have internal predecessors, (2341), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:43:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2441 transitions. [2023-11-28 20:43:20,786 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2441 transitions. Word has length 153 [2023-11-28 20:43:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:20,786 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 2441 transitions. [2023-11-28 20:43:20,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:43:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2441 transitions. [2023-11-28 20:43:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-28 20:43:20,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:20,788 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:43:20,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-11-28 20:43:20,788 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:20,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1618808223, now seen corresponding path program 1 times [2023-11-28 20:43:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:20,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366659102] [2023-11-28 20:43:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:43:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:43:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:43:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:43:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:43:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:43:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:43:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:43:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:43:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:43:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:43:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:43:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:43:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366659102] [2023-11-28 20:43:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366659102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:41,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-11-28 20:43:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804898148] [2023-11-28 20:43:41,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:41,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-28 20:43:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-28 20:43:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=733, Unknown=1, NotChecked=0, Total=812 [2023-11-28 20:43:41,558 INFO L87 Difference]: Start difference. First operand 1950 states and 2441 transitions. Second operand has 29 states, 27 states have (on average 2.259259259259259) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:43:47,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:43:52,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:44:12,387 WARN L293 SmtUtils]: Spent 10.91s on a formula simplification. DAG size of input: 219 DAG size of output: 173 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:44:35,519 WARN L293 SmtUtils]: Spent 20.25s on a formula simplification. DAG size of input: 243 DAG size of output: 204 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:45:07,223 WARN L293 SmtUtils]: Spent 25.25s on a formula simplification. DAG size of input: 266 DAG size of output: 221 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:45:49,805 WARN L293 SmtUtils]: Spent 38.48s on a formula simplification. DAG size of input: 272 DAG size of output: 227 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:46:14,829 WARN L293 SmtUtils]: Spent 23.71s on a formula simplification. DAG size of input: 275 DAG size of output: 230 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:46:56,334 WARN L293 SmtUtils]: Spent 34.73s on a formula simplification. DAG size of input: 276 DAG size of output: 237 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:46:57,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:47:00,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:47:02,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:47:05,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:47:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:06,367 INFO L93 Difference]: Finished difference Result 4130 states and 5185 transitions. [2023-11-28 20:47:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-28 20:47:06,367 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.259259259259259) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2023-11-28 20:47:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:06,371 INFO L225 Difference]: With dead ends: 4130 [2023-11-28 20:47:06,371 INFO L226 Difference]: Without dead ends: 2804 [2023-11-28 20:47:06,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 190.2s TimeCoverageRelationStatistics Valid=449, Invalid=2412, Unknown=1, NotChecked=0, Total=2862 [2023-11-28 20:47:06,373 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 900 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 118 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 3148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:06,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1688 Invalid, 3148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3029 Invalid, 1 Unknown, 0 Unchecked, 20.5s Time] [2023-11-28 20:47:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2023-11-28 20:47:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 1952. [2023-11-28 20:47:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1894 states have (on average 1.2370644139387539) internal successors, (2343), 1897 states have internal predecessors, (2343), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:47:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2443 transitions. [2023-11-28 20:47:06,484 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2443 transitions. Word has length 153 [2023-11-28 20:47:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:06,485 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 2443 transitions. [2023-11-28 20:47:06,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.259259259259259) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:47:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2443 transitions. [2023-11-28 20:47:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-28 20:47:06,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:06,488 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:06,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-11-28 20:47:06,488 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:06,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2074368167, now seen corresponding path program 1 times [2023-11-28 20:47:06,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:06,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559358457] [2023-11-28 20:47:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:12,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:12,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559358457] [2023-11-28 20:47:12,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559358457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:12,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:12,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-11-28 20:47:12,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730293808] [2023-11-28 20:47:12,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:12,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-28 20:47:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:12,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-28 20:47:12,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-11-28 20:47:12,625 INFO L87 Difference]: Start difference. First operand 1952 states and 2443 transitions. Second operand has 26 states, 23 states have (on average 2.652173913043478) internal successors, (61), 26 states have internal predecessors, (61), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-28 20:47:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:20,477 INFO L93 Difference]: Finished difference Result 3705 states and 4689 transitions. [2023-11-28 20:47:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 20:47:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.652173913043478) internal successors, (61), 26 states have internal predecessors, (61), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) Word has length 153 [2023-11-28 20:47:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:20,480 INFO L225 Difference]: With dead ends: 3705 [2023-11-28 20:47:20,480 INFO L226 Difference]: Without dead ends: 2350 [2023-11-28 20:47:20,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2023-11-28 20:47:20,482 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 517 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 2960 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:20,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1718 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2960 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-28 20:47:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2023-11-28 20:47:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 1959. [2023-11-28 20:47:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1901 states have (on average 1.2367175170962652) internal successors, (2351), 1904 states have internal predecessors, (2351), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-28 20:47:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2451 transitions. [2023-11-28 20:47:20,670 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2451 transitions. Word has length 153 [2023-11-28 20:47:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:20,670 INFO L495 AbstractCegarLoop]: Abstraction has 1959 states and 2451 transitions. [2023-11-28 20:47:20,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.652173913043478) internal successors, (61), 26 states have internal predecessors, (61), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 6 states have call successors, (19) [2023-11-28 20:47:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2451 transitions. [2023-11-28 20:47:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-28 20:47:20,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:20,673 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:20,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-11-28 20:47:20,673 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:20,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:20,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1072040983, now seen corresponding path program 1 times [2023-11-28 20:47:20,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:20,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562049805] [2023-11-28 20:47:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:21,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:21,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562049805] [2023-11-28 20:47:21,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562049805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:21,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:21,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:47:21,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807965530] [2023-11-28 20:47:21,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:21,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:47:21,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:21,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:47:21,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:47:21,827 INFO L87 Difference]: Start difference. First operand 1959 states and 2451 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:47:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:22,751 INFO L93 Difference]: Finished difference Result 4898 states and 6125 transitions. [2023-11-28 20:47:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:47:22,752 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2023-11-28 20:47:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:22,756 INFO L225 Difference]: With dead ends: 4898 [2023-11-28 20:47:22,756 INFO L226 Difference]: Without dead ends: 3540 [2023-11-28 20:47:22,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:47:22,759 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 356 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:22,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 527 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:47:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states. [2023-11-28 20:47:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 2935. [2023-11-28 20:47:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2935 states, 2849 states have (on average 1.2376272376272377) internal successors, (3526), 2856 states have internal predecessors, (3526), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-28 20:47:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 3674 transitions. [2023-11-28 20:47:22,977 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 3674 transitions. Word has length 155 [2023-11-28 20:47:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:22,977 INFO L495 AbstractCegarLoop]: Abstraction has 2935 states and 3674 transitions. [2023-11-28 20:47:22,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:47:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 3674 transitions. [2023-11-28 20:47:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-28 20:47:22,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:22,980 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:22,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2023-11-28 20:47:22,980 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:22,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash 562567893, now seen corresponding path program 1 times [2023-11-28 20:47:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245208330] [2023-11-28 20:47:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:23,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245208330] [2023-11-28 20:47:23,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245208330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:23,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:23,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:47:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440142993] [2023-11-28 20:47:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:23,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:47:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:47:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:47:23,372 INFO L87 Difference]: Start difference. First operand 2935 states and 3674 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:47:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:24,057 INFO L93 Difference]: Finished difference Result 5658 states and 7100 transitions. [2023-11-28 20:47:24,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:47:24,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2023-11-28 20:47:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:24,060 INFO L225 Difference]: With dead ends: 5658 [2023-11-28 20:47:24,060 INFO L226 Difference]: Without dead ends: 3619 [2023-11-28 20:47:24,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:47:24,062 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 306 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:24,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 471 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:47:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2023-11-28 20:47:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 2959. [2023-11-28 20:47:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2873 states have (on average 1.2384267316394013) internal successors, (3558), 2880 states have internal predecessors, (3558), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-28 20:47:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 3706 transitions. [2023-11-28 20:47:24,256 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 3706 transitions. Word has length 155 [2023-11-28 20:47:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:24,257 INFO L495 AbstractCegarLoop]: Abstraction has 2959 states and 3706 transitions. [2023-11-28 20:47:24,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:47:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3706 transitions. [2023-11-28 20:47:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-28 20:47:24,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:24,260 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:24,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2023-11-28 20:47:24,260 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:24,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash 72641460, now seen corresponding path program 1 times [2023-11-28 20:47:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019092113] [2023-11-28 20:47:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019092113] [2023-11-28 20:47:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019092113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:24,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:24,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:47:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461106087] [2023-11-28 20:47:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:24,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:47:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:47:24,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:47:24,476 INFO L87 Difference]: Start difference. First operand 2959 states and 3706 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:25,067 INFO L93 Difference]: Finished difference Result 5641 states and 7137 transitions. [2023-11-28 20:47:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:47:25,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2023-11-28 20:47:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:25,070 INFO L225 Difference]: With dead ends: 5641 [2023-11-28 20:47:25,070 INFO L226 Difference]: Without dead ends: 3523 [2023-11-28 20:47:25,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:47:25,072 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 126 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:25,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 686 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:47:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2023-11-28 20:47:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2959. [2023-11-28 20:47:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2873 states have (on average 1.231117298990602) internal successors, (3537), 2880 states have internal predecessors, (3537), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-28 20:47:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 3685 transitions. [2023-11-28 20:47:25,269 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 3685 transitions. Word has length 156 [2023-11-28 20:47:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:25,270 INFO L495 AbstractCegarLoop]: Abstraction has 2959 states and 3685 transitions. [2023-11-28 20:47:25,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3685 transitions. [2023-11-28 20:47:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-28 20:47:25,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:25,273 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:25,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2023-11-28 20:47:25,273 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:25,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 773706038, now seen corresponding path program 1 times [2023-11-28 20:47:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:25,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23955818] [2023-11-28 20:47:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23955818] [2023-11-28 20:47:25,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23955818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:25,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:25,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:47:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026841693] [2023-11-28 20:47:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:25,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:47:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:47:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:47:25,427 INFO L87 Difference]: Start difference. First operand 2959 states and 3685 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:25,747 INFO L93 Difference]: Finished difference Result 5601 states and 7055 transitions. [2023-11-28 20:47:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 20:47:25,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2023-11-28 20:47:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:25,749 INFO L225 Difference]: With dead ends: 5601 [2023-11-28 20:47:25,749 INFO L226 Difference]: Without dead ends: 3506 [2023-11-28 20:47:25,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:47:25,751 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 107 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:25,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1025 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:47:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2023-11-28 20:47:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 2891. [2023-11-28 20:47:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2805 states have (on average 1.231372549019608) internal successors, (3454), 2812 states have internal predecessors, (3454), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-28 20:47:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 3602 transitions. [2023-11-28 20:47:25,944 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 3602 transitions. Word has length 156 [2023-11-28 20:47:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:25,945 INFO L495 AbstractCegarLoop]: Abstraction has 2891 states and 3602 transitions. [2023-11-28 20:47:25,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 3602 transitions. [2023-11-28 20:47:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-28 20:47:25,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:25,948 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:25,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2023-11-28 20:47:25,948 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:25,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -106163148, now seen corresponding path program 1 times [2023-11-28 20:47:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123663453] [2023-11-28 20:47:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123663453] [2023-11-28 20:47:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123663453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:26,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:26,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:47:26,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888755174] [2023-11-28 20:47:26,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:26,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:47:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:26,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:47:26,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:47:26,125 INFO L87 Difference]: Start difference. First operand 2891 states and 3602 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:26,865 INFO L93 Difference]: Finished difference Result 5985 states and 7466 transitions. [2023-11-28 20:47:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:47:26,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2023-11-28 20:47:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:26,868 INFO L225 Difference]: With dead ends: 5985 [2023-11-28 20:47:26,868 INFO L226 Difference]: Without dead ends: 3962 [2023-11-28 20:47:26,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:47:26,870 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 220 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:26,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 575 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:47:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2023-11-28 20:47:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3121. [2023-11-28 20:47:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3035 states have (on average 1.228665568369028) internal successors, (3729), 3042 states have internal predecessors, (3729), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-28 20:47:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 3877 transitions. [2023-11-28 20:47:27,078 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 3877 transitions. Word has length 156 [2023-11-28 20:47:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:27,078 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 3877 transitions. [2023-11-28 20:47:27,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 3877 transitions. [2023-11-28 20:47:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-28 20:47:27,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:27,081 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:27,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2023-11-28 20:47:27,081 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:27,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1881170510, now seen corresponding path program 1 times [2023-11-28 20:47:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99904407] [2023-11-28 20:47:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:27,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:28,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99904407] [2023-11-28 20:47:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99904407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:28,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:28,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:47:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832947094] [2023-11-28 20:47:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:28,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:47:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:47:28,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:47:28,069 INFO L87 Difference]: Start difference. First operand 3121 states and 3877 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:47:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:28,972 INFO L93 Difference]: Finished difference Result 5255 states and 6586 transitions. [2023-11-28 20:47:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:47:28,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 156 [2023-11-28 20:47:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:28,974 INFO L225 Difference]: With dead ends: 5255 [2023-11-28 20:47:28,974 INFO L226 Difference]: Without dead ends: 3242 [2023-11-28 20:47:28,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:47:28,977 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 421 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:28,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 360 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:47:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2023-11-28 20:47:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3123. [2023-11-28 20:47:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 3036 states have (on average 1.2246376811594204) internal successors, (3718), 3043 states have internal predecessors, (3718), 74 states have call successors, (74), 12 states have call predecessors, (74), 12 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-28 20:47:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 3866 transitions. [2023-11-28 20:47:29,179 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 3866 transitions. Word has length 156 [2023-11-28 20:47:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:29,180 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 3866 transitions. [2023-11-28 20:47:29,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-28 20:47:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 3866 transitions. [2023-11-28 20:47:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-28 20:47:29,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:29,182 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:29,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2023-11-28 20:47:29,182 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:29,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:29,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1201112140, now seen corresponding path program 1 times [2023-11-28 20:47:29,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:29,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357385691] [2023-11-28 20:47:29,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:29,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357385691] [2023-11-28 20:47:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357385691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:47:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960737540] [2023-11-28 20:47:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:29,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:47:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:29,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:47:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:47:29,565 INFO L87 Difference]: Start difference. First operand 3123 states and 3866 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:47:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:30,154 INFO L93 Difference]: Finished difference Result 5155 states and 6435 transitions. [2023-11-28 20:47:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:47:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2023-11-28 20:47:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:30,156 INFO L225 Difference]: With dead ends: 5155 [2023-11-28 20:47:30,156 INFO L226 Difference]: Without dead ends: 3145 [2023-11-28 20:47:30,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:47:30,159 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 278 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:30,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 325 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:47:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2023-11-28 20:47:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 3061. [2023-11-28 20:47:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 2974 states have (on average 1.2236045729657028) internal successors, (3639), 2981 states have internal predecessors, (3639), 74 states have call successors, (74), 12 states have call predecessors, (74), 12 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-11-28 20:47:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 3787 transitions. [2023-11-28 20:47:30,358 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 3787 transitions. Word has length 156 [2023-11-28 20:47:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:30,358 INFO L495 AbstractCegarLoop]: Abstraction has 3061 states and 3787 transitions. [2023-11-28 20:47:30,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:47:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3787 transitions. [2023-11-28 20:47:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-28 20:47:30,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:30,361 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:30,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2023-11-28 20:47:30,361 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:30,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1715287628, now seen corresponding path program 1 times [2023-11-28 20:47:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045820518] [2023-11-28 20:47:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-28 20:47:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045820518] [2023-11-28 20:47:30,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045820518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:47:30,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716228186] [2023-11-28 20:47:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:30,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:47:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:47:30,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:47:30,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:47:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:31,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-28 20:47:31,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:47:32,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-28 20:47:32,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 20:47:32,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 20:47:32,920 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-28 20:47:32,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2023-11-28 20:47:32,950 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-28 20:47:32,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-28 20:47:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 57 proven. 169 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2023-11-28 20:47:32,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:47:33,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716228186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:47:33,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:47:33,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2023-11-28 20:47:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923045197] [2023-11-28 20:47:33,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:47:33,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-28 20:47:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:33,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-28 20:47:33,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:47:33,140 INFO L87 Difference]: Start difference. First operand 3061 states and 3787 transitions. Second operand has 22 states, 20 states have (on average 5.65) internal successors, (113), 20 states have internal predecessors, (113), 7 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2023-11-28 20:47:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:34,846 INFO L93 Difference]: Finished difference Result 5761 states and 7131 transitions. [2023-11-28 20:47:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 20:47:34,847 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 5.65) internal successors, (113), 20 states have internal predecessors, (113), 7 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) Word has length 156 [2023-11-28 20:47:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:34,850 INFO L225 Difference]: With dead ends: 5761 [2023-11-28 20:47:34,850 INFO L226 Difference]: Without dead ends: 3447 [2023-11-28 20:47:34,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2023-11-28 20:47:34,852 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 601 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:34,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1262 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 20:47:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2023-11-28 20:47:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3422. [2023-11-28 20:47:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 3302 states have (on average 1.2062386432465173) internal successors, (3983), 3313 states have internal predecessors, (3983), 101 states have call successors, (101), 18 states have call predecessors, (101), 18 states have return successors, (101), 90 states have call predecessors, (101), 101 states have call successors, (101) [2023-11-28 20:47:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4185 transitions. [2023-11-28 20:47:35,154 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4185 transitions. Word has length 156 [2023-11-28 20:47:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:35,154 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4185 transitions. [2023-11-28 20:47:35,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 5.65) internal successors, (113), 20 states have internal predecessors, (113), 7 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2023-11-28 20:47:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4185 transitions. [2023-11-28 20:47:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-28 20:47:35,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:35,157 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:35,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:47:35,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2023-11-28 20:47:35,357 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:35,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash 192943702, now seen corresponding path program 1 times [2023-11-28 20:47:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:35,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510023851] [2023-11-28 20:47:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:47:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:47:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:47:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-28 20:47:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-28 20:47:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:47:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:47:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:47:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-28 20:47:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-28 20:47:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:47:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:36,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:47:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:36,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:47:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:36,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-28 20:47:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510023851] [2023-11-28 20:47:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510023851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:36,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:47:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050288977] [2023-11-28 20:47:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:36,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:47:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:47:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:47:36,013 INFO L87 Difference]: Start difference. First operand 3422 states and 4185 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:36,746 INFO L93 Difference]: Finished difference Result 4518 states and 5462 transitions. [2023-11-28 20:47:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:47:36,747 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2023-11-28 20:47:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:36,751 INFO L225 Difference]: With dead ends: 4518 [2023-11-28 20:47:36,751 INFO L226 Difference]: Without dead ends: 4516 [2023-11-28 20:47:36,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:47:36,752 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 198 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:36,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 932 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:47:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2023-11-28 20:47:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 4473. [2023-11-28 20:47:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4473 states, 4353 states have (on average 1.1957270847691248) internal successors, (5205), 4364 states have internal predecessors, (5205), 101 states have call successors, (101), 18 states have call predecessors, (101), 18 states have return successors, (101), 90 states have call predecessors, (101), 101 states have call successors, (101) [2023-11-28 20:47:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 5407 transitions. [2023-11-28 20:47:37,178 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 5407 transitions. Word has length 158 [2023-11-28 20:47:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:37,178 INFO L495 AbstractCegarLoop]: Abstraction has 4473 states and 5407 transitions. [2023-11-28 20:47:37,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 5407 transitions. [2023-11-28 20:47:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-28 20:47:37,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:37,184 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:37,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2023-11-28 20:47:37,184 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:37,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash -415159848, now seen corresponding path program 1 times [2023-11-28 20:47:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220199590] [2023-11-28 20:47:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:47:37,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:47:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:47:37,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:47:37,451 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:47:37,452 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:47:37,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2023-11-28 20:47:37,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:37,458 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:47:37,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-11-28 20:47:37,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-28 20:47:37,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-11-28 20:47:37,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-28 20:47:37,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-11-28 20:47:37,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-11-28 20:47:37,551 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-28 20:47:37,553 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-28 20:47:37,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-28 20:47:37,556 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-28 20:47:37,557 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-28 20:47:37,559 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-11-28 20:47:37,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-28 20:47:37,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-28 20:47:37,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-28 20:47:37,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated [2023-11-28 20:47:37,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-28 20:47:37,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short78 could not be translated [2023-11-28 20:47:37,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-28 20:47:37,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short82 could not be translated [2023-11-28 20:47:37,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated [2023-11-28 20:47:37,564 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short78 could not be translated [2023-11-28 20:47:37,564 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated [2023-11-28 20:47:37,565 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short82 could not be translated [2023-11-28 20:47:37,565 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-28 20:47:37,566 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-28 20:47:37,566 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-28 20:47:37,567 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-28 20:47:37,568 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-28 20:47:37,568 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-28 20:47:37,568 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-28 20:47:37,568 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem11 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite10 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem11 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite10 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-11-28 20:47:37,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated [2023-11-28 20:47:37,570 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated [2023-11-28 20:47:37,570 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated [2023-11-28 20:47:37,570 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated [2023-11-28 20:47:37,570 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-11-28 20:47:37,570 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-28 20:47:37,571 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-28 20:47:37,571 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated [2023-11-28 20:47:37,571 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-28 20:47:37,571 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-11-28 20:47:37,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated [2023-11-28 20:47:37,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated [2023-11-28 20:47:37,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,578 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-28 20:47:37,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated [2023-11-28 20:47:37,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated [2023-11-28 20:47:37,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-28 20:47:37,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,581 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-28 20:47:37,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated [2023-11-28 20:47:37,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-28 20:47:37,582 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated [2023-11-28 20:47:37,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated [2023-11-28 20:47:37,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite130 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-28 20:47:37,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-28 20:47:37,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite130 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite130 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short138 could not be translated [2023-11-28 20:47:37,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated [2023-11-28 20:47:37,592 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-28 20:47:37,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-28 20:47:37,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite130 could not be translated [2023-11-28 20:47:37,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated [2023-11-28 20:47:37,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short138 could not be translated [2023-11-28 20:47:37,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-28 20:47:37,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated [2023-11-28 20:47:37,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-28 20:47:37,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated [2023-11-28 20:47:37,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated [2023-11-28 20:47:37,595 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-28 20:47:37,595 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short158 could not be translated [2023-11-28 20:47:37,595 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated [2023-11-28 20:47:37,595 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated [2023-11-28 20:47:37,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:47:37 BoogieIcfgContainer [2023-11-28 20:47:37,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:47:37,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:47:37,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:47:37,621 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:47:37,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:18" (3/4) ... [2023-11-28 20:47:37,623 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:47:37,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:47:37,624 INFO L158 Benchmark]: Toolchain (without parser) took 500298.17ms. Allocated memory was 138.4MB in the beginning and 813.7MB in the end (delta: 675.3MB). Free memory was 93.8MB in the beginning and 391.7MB in the end (delta: -298.0MB). Peak memory consumption was 377.8MB. Max. memory is 16.1GB. [2023-11-28 20:47:37,624 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:47:37,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.37ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 77.5MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-28 20:47:37,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.09ms. Allocated memory is still 138.4MB. Free memory was 77.5MB in the beginning and 72.8MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-28 20:47:37,625 INFO L158 Benchmark]: Boogie Preprocessor took 84.98ms. Allocated memory is still 138.4MB. Free memory was 72.8MB in the beginning and 67.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:47:37,625 INFO L158 Benchmark]: RCFGBuilder took 755.67ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 67.7MB in the beginning and 111.1MB in the end (delta: -43.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-11-28 20:47:37,626 INFO L158 Benchmark]: TraceAbstraction took 499050.58ms. Allocated memory was 176.2MB in the beginning and 813.7MB in the end (delta: 637.5MB). Free memory was 110.0MB in the beginning and 392.8MB in the end (delta: -282.8MB). Peak memory consumption was 354.6MB. Max. memory is 16.1GB. [2023-11-28 20:47:37,626 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 813.7MB. Free memory was 392.8MB in the beginning and 391.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:47:37,627 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.17ms. Allocated memory is still 138.4MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.37ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 77.5MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.09ms. Allocated memory is still 138.4MB. Free memory was 77.5MB in the beginning and 72.8MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.98ms. Allocated memory is still 138.4MB. Free memory was 72.8MB in the beginning and 67.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 755.67ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 67.7MB in the beginning and 111.1MB in the end (delta: -43.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 499050.58ms. Allocated memory was 176.2MB in the beginning and 813.7MB in the end (delta: 637.5MB). Free memory was 110.0MB in the beginning and 392.8MB in the end (delta: -282.8MB). Peak memory consumption was 354.6MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 813.7MB. Free memory was 392.8MB in the beginning and 391.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem77 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short138 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem127 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite130 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short138 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short158 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short131 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 139. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 128, 16, 2, 8, 10.5, 0, 0, 99.25, 64, 0, 0, 1 }; [L55] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] signed char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L65] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L66] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L68] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L69] unsigned char last_1_WrapperStruct00_var_1_14 = 64; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] CALL updateLastVariables() [L136] EXPR WrapperStruct00.var_1_14 [L136] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L146] RET updateLastVariables() [L147] CALL updateVariables() [L105] WrapperStruct00.var_1_3 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 16) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 16) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L108] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L110] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L111] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L113] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L114] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L116] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L117] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L120] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L122] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L123] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L125] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L126] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L127] EXPR WrapperStruct00.var_1_13 [L127] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L127] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L127] EXPR WrapperStruct00.var_1_13 [L127] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L127] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L127] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L127] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L127] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L128] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L129] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L130] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L131] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L132] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L133] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L147] RET updateVariables() [L148] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L73] EXPR last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L73] COND TRUE (last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14 [L74] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L74] EXPR (((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L74] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L74] EXPR (((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L74] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) [L74] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L74] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L74] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) [L78] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L78] COND FALSE !(((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L81] (*(WrapperStruct00_var_1_12_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L81] (*(WrapperStruct00_var_1_12_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L81] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L82] EXPR (*(WrapperStruct00_var_1_8_Pointer)) << (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L82] COND FALSE !((*(WrapperStruct00_var_1_1_Pointer)) >= ((*(WrapperStruct00_var_1_8_Pointer)) << (*(WrapperStruct00_var_1_3_Pointer)))) [L89] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L89] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L94] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_14_Pointer)); [L95] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L95] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_16_Pointer)); [L96] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L96] COND TRUE (*(WrapperStruct00_var_1_16_Pointer)) [L97] stepLocal_0 || (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64, stepLocal_0=1, stepLocal_1=64] [L97] stepLocal_0 || (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L97] COND TRUE stepLocal_0 || (*(WrapperStruct00_var_1_16_Pointer)) [L98] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L98] COND TRUE stepLocal_1 > (*(WrapperStruct00_var_1_6_Pointer)) [L99] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L99] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR ((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) [L139] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L139] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L139] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L139] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L139] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L139] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L139] EXPR (((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) [L139] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L139] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR ((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1) [L139] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1 [L139] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L139] EXPR (*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR ((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1 [L139] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L139] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR ((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1 [L139] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L139] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L139] EXPR ((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR ((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR ((((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR ((((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (((((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_12_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) >= ((*(WrapperStruct00_var_1_8_Pointer)) << (*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139] EXPR (((((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_12_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) >= ((*(WrapperStruct00_var_1_8_Pointer)) << (*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L139-L140] return (((((last_1_WrapperStruct00_var_1_14 >> (*(WrapperStruct00_var_1_3_Pointer))) >= last_1_WrapperStruct00_var_1_14) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((*(WrapperStruct00_var_1_5_Pointer)) - (((((*(WrapperStruct00_var_1_6_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))))))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) + ((((((*(WrapperStruct00_var_1_8_Pointer)) + 1)) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) + 1)) : ((*(WrapperStruct00_var_1_7_Pointer))))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? (((*(WrapperStruct00_var_1_16_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))) ? (((*(WrapperStruct00_var_1_14_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_12_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) >= ((*(WrapperStruct00_var_1_8_Pointer)) << (*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer))))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:15}, WrapperStruct00_var_1_13_Pointer={4:16}, WrapperStruct00_var_1_14_Pointer={4:24}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:26}, WrapperStruct00_var_1_18_Pointer={4:27}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 498.8s, OverallIterations: 72, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 327.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 30904 SdHoareTripleChecker+Valid, 92.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30843 mSDsluCounter, 59495 SdHoareTripleChecker+Invalid, 84.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49475 mSDsCounter, 3057 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79391 IncrementalHoareTripleChecker+Invalid, 82449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3057 mSolverCounterUnsat, 10020 mSDtfsCounter, 79391 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4868 GetRequests, 3426 SyntacticMatches, 41 SemanticMatches, 1401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7667 ImplicationChecksByTransitivity, 254.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4473occurred in iteration=71, InterpolantAutomatonStates: 894, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 71 MinimizatonAttempts, 13641 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 159.8s InterpolantComputationTime, 10980 NumberOfCodeBlocks, 10980 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 10750 ConstructedInterpolants, 0 QuantifiedInterpolants, 167552 SizeOfPredicates, 16 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 72 InterpolantComputations, 70 PerfectInterpolantSequences, 49073/49248 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:47:37,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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 dac49eff911c415c5e3abe3f83531cb71a1bf616fed1a86cc9f731a40011a721 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:47:39,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:47:39,697 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:47:39,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:47:39,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:47:39,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:47:39,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:47:39,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:47:39,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:47:39,744 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:47:39,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:47:39,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:47:39,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:47:39,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:47:39,747 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:47:39,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:47:39,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:47:39,749 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:47:39,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:47:39,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:47:39,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:47:39,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:47:39,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:47:39,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:47:39,752 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:47:39,752 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:47:39,753 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:47:39,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:47:39,754 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:47:39,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:47:39,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:47:39,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:47:39,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:47:39,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:47:39,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:47:39,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:47:39,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:47:39,757 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:47:39,757 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:47:39,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:47:39,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:47:39,757 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:47:39,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:47:39,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:47:39,758 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:47:39,758 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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/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 -> dac49eff911c415c5e3abe3f83531cb71a1bf616fed1a86cc9f731a40011a721 [2023-11-28 20:47:40,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:47:40,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:47:40,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:47:40,088 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:47:40,088 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:47:40,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i [2023-11-28 20:47:43,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:47:43,233 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:47:43,233 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i [2023-11-28 20:47:43,244 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/data/3e6c50a74/2e0ebe13073c4eaf8b407084d3db0d27/FLAG4b3b8ca05 [2023-11-28 20:47:43,258 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/data/3e6c50a74/2e0ebe13073c4eaf8b407084d3db0d27 [2023-11-28 20:47:43,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:47:43,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:47:43,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:47:43,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:47:43,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:47:43,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e31db02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43, skipping insertion in model container [2023-11-28 20:47:43,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,300 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:47:43,427 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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i[917,930] [2023-11-28 20:47:43,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:47:43,513 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:47:43,523 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_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i[917,930] [2023-11-28 20:47:43,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:47:43,587 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:47:43,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43 WrapperNode [2023-11-28 20:47:43,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:47:43,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:47:43,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:47:43,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:47:43,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,652 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2023-11-28 20:47:43,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:47:43,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:47:43,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:47:43,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:47:43,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,700 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2023-11-28 20:47:43,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:47:43,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:47:43,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:47:43,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:47:43,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (1/1) ... [2023-11-28 20:47:43,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:47:43,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:47:43,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:47:43,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:47:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:47:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-28 20:47:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-28 20:47:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-28 20:47:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-28 20:47:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-28 20:47:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-28 20:47:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:47:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 20:47:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-11-28 20:47:43,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-11-28 20:47:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:47:43,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:47:43,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:47:43,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:47:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-28 20:47:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-28 20:47:43,987 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:47:43,990 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:47:44,593 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:47:44,652 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:47:44,653 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:47:44,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:47:44 BoogieIcfgContainer [2023-11-28 20:47:44,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:47:44,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:47:44,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:47:44,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:47:44,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:47:43" (1/3) ... [2023-11-28 20:47:44,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2150da9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:47:44, skipping insertion in model container [2023-11-28 20:47:44,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:47:43" (2/3) ... [2023-11-28 20:47:44,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2150da9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:47:44, skipping insertion in model container [2023-11-28 20:47:44,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:47:44" (3/3) ... [2023-11-28 20:47:44,662 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-56.i [2023-11-28 20:47:44,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:47:44,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:47:44,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:47:44,737 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;@58b6e733, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:47:44,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:47:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:47:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-28 20:47:44,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:44,759 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:44,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:44,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:44,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1935733718, now seen corresponding path program 1 times [2023-11-28 20:47:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:47:44,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465042924] [2023-11-28 20:47:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:47:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:47:44,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:47:44,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 20:47:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:45,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:47:45,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:47:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2023-11-28 20:47:45,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:47:45,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:47:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465042924] [2023-11-28 20:47:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465042924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:45,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:47:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832983410] [2023-11-28 20:47:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:45,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:47:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:47:45,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:47:45,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:47:45,181 INFO L87 Difference]: Start difference. First operand has 111 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:47:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:45,232 INFO L93 Difference]: Finished difference Result 219 states and 353 transitions. [2023-11-28 20:47:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:47:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2023-11-28 20:47:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:45,242 INFO L225 Difference]: With dead ends: 219 [2023-11-28 20:47:45,243 INFO L226 Difference]: Without dead ends: 109 [2023-11-28 20:47:45,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-28 20:47:45,250 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:45,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:47:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-28 20:47:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-28 20:47:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:47:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2023-11-28 20:47:45,295 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 144 [2023-11-28 20:47:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:45,296 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2023-11-28 20:47:45,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-28 20:47:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2023-11-28 20:47:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-28 20:47:45,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:45,300 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:45,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:47:45,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:47:45,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:45,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash 278601752, now seen corresponding path program 1 times [2023-11-28 20:47:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:47:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441687832] [2023-11-28 20:47:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:45,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:47:45,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:47:45,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:47:45,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 20:47:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:45,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:47:45,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:47:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:47:45,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:47:45,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:47:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441687832] [2023-11-28 20:47:45,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441687832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:45,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:45,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:47:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646562106] [2023-11-28 20:47:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:45,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:47:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:47:45,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:47:45,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:47:45,835 INFO L87 Difference]: Start difference. First operand 109 states and 163 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:45,885 INFO L93 Difference]: Finished difference Result 218 states and 327 transitions. [2023-11-28 20:47:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:47:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2023-11-28 20:47:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:45,889 INFO L225 Difference]: With dead ends: 218 [2023-11-28 20:47:45,889 INFO L226 Difference]: Without dead ends: 110 [2023-11-28 20:47:45,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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-28 20:47:45,892 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:45,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:47:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-28 20:47:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-28 20:47:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-28 20:47:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2023-11-28 20:47:45,909 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 144 [2023-11-28 20:47:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:45,912 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2023-11-28 20:47:45,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:47:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2023-11-28 20:47:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-28 20:47:45,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:45,916 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:47:45,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:47:46,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:47:46,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:46,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:46,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1715542954, now seen corresponding path program 1 times [2023-11-28 20:47:46,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:47:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364779220] [2023-11-28 20:47:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:46,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:47:46,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:47:46,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:47:46,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 20:47:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:46,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-28 20:47:46,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:47:46,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 20:47:46,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-28 20:47:47,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-11-28 20:47:48,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-11-28 20:47:49,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2023-11-28 20:47:50,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-11-28 20:47:51,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2023-11-28 20:47:51,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2023-11-28 20:47:52,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 62 [2023-11-28 20:47:53,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2023-11-28 20:47:54,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 81 [2023-11-28 20:47:55,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 98 [2023-11-28 20:47:55,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2023-11-28 20:47:56,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:47:56,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 98 treesize of output 54 [2023-11-28 20:47:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 378 proven. 226 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-28 20:47:56,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:47:57,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:47:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364779220] [2023-11-28 20:47:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364779220] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:47:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [435596167] [2023-11-28 20:47:57,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:57,987 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:47:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:47:57,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:47:57,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-28 20:47:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:58,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-28 20:47:58,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:47:58,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-28 20:48:01,412 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-28 20:48:01,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-28 20:48:01,766 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-28 20:48:01,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 35 [2023-11-28 20:48:02,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:48:02,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 38 [2023-11-28 20:48:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-28 20:48:02,530 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:48:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [435596167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:48:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 20:48:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [26] total 35 [2023-11-28 20:48:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413692369] [2023-11-28 20:48:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:48:02,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:48:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:48:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:48:02,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1764, Unknown=0, NotChecked=0, Total=1980 [2023-11-28 20:48:02,534 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:48:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:48:06,553 INFO L93 Difference]: Finished difference Result 484 states and 723 transitions. [2023-11-28 20:48:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:48:06,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2023-11-28 20:48:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:48:06,558 INFO L225 Difference]: With dead ends: 484 [2023-11-28 20:48:06,558 INFO L226 Difference]: Without dead ends: 375 [2023-11-28 20:48:06,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=394, Invalid=3146, Unknown=0, NotChecked=0, Total=3540 [2023-11-28 20:48:06,562 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 822 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:48:06,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 999 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1216 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2023-11-28 20:48:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-11-28 20:48:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 238. [2023-11-28 20:48:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 197 states have (on average 1.4365482233502538) internal successors, (283), 197 states have internal predecessors, (283), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-28 20:48:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 359 transitions. [2023-11-28 20:48:06,603 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 359 transitions. Word has length 144 [2023-11-28 20:48:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:48:06,604 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 359 transitions. [2023-11-28 20:48:06,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-28 20:48:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 359 transitions. [2023-11-28 20:48:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-28 20:48:06,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:48:06,607 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:48:06,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-28 20:48:06,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-11-28 20:48:07,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 20:48:07,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:48:07,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:48:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -897894504, now seen corresponding path program 1 times [2023-11-28 20:48:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:48:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945756276] [2023-11-28 20:48:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:48:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:48:07,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:48:07,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:48:07,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-28 20:48:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:07,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-28 20:48:07,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:48:07,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 20:48:07,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-28 20:48:08,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-11-28 20:48:09,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2023-11-28 20:48:09,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-11-28 20:48:10,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2023-11-28 20:48:11,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-11-28 20:48:12,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2023-11-28 20:48:13,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 70 [2023-11-28 20:48:17,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 81 [2023-11-28 20:48:19,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 92 [2023-11-28 20:48:20,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 109 [2023-11-28 20:48:21,215 INFO L349 Elim1Store]: treesize reduction 127, result has 10.6 percent of original size [2023-11-28 20:48:21,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 136 [2023-11-28 20:48:21,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 124 [2023-11-28 20:48:22,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:48:22,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 115 treesize of output 63 [2023-11-28 20:48:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 394 proven. 226 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-28 20:48:22,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:49:30,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:49:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945756276] [2023-11-28 20:49:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945756276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:49:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455800458] [2023-11-28 20:49:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:49:30,443 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:49:30,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:49:30,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:49:30,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ed144ff-1c4b-4c6a-9d3c-fe33762732e4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-11-28 20:49:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:49:31,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-28 20:49:31,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:49:31,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-28 20:49:35,902 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-28 20:49:35,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-28 20:49:36,253 INFO L349 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2023-11-28 20:49:36,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 63 [2023-11-28 20:49:37,375 INFO L349 Elim1Store]: treesize reduction 128, result has 42.1 percent of original size [2023-11-28 20:49:37,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 182 treesize of output 205 [2023-11-28 20:51:18,750 WARN L293 SmtUtils]: Spent 23.31s on a formula simplification that was a NOOP. DAG size: 1358 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)