./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.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_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/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_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/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_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/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 ec3847cd5673658302b62e6c9d30f5f024379aa30b6673222fdbc3270a2b4500 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:03:03,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:03:03,745 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:03:03,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:03:03,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:03:03,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:03:03,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:03:03,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:03:03,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:03:03,778 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:03:03,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:03:03,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:03:03,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:03:03,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:03:03,781 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:03:03,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:03:03,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:03:03,782 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:03:03,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:03:03,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:03:03,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:03:03,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:03:03,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:03:03,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:03:03,785 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:03:03,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:03:03,786 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:03:03,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:03:03,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:03:03,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:03:03,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:03:03,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:03:03,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:03:03,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:03:03,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:03:03,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:03:03,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:03:03,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:03:03,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:03:03,789 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:03:03,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:03:03,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:03:03,790 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_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/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_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/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 -> ec3847cd5673658302b62e6c9d30f5f024379aa30b6673222fdbc3270a2b4500 [2023-11-29 01:03:04,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:03:04,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:03:04,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:03:04,054 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:03:04,054 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:03:04,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2023-11-29 01:03:06,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:03:07,015 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:03:07,015 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2023-11-29 01:03:07,025 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/data/79cc216bb/1f85b11c9dd24699a677dc66e147eb47/FLAG873172eff [2023-11-29 01:03:07,036 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/data/79cc216bb/1f85b11c9dd24699a677dc66e147eb47 [2023-11-29 01:03:07,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:03:07,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:03:07,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:03:07,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:03:07,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:03:07,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cdd73e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07, skipping insertion in model container [2023-11-29 01:03:07,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,077 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:03:07,212 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_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i[916,929] [2023-11-29 01:03:07,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:03:07,268 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:03:07,279 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_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i[916,929] [2023-11-29 01:03:07,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:03:07,318 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:03:07,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07 WrapperNode [2023-11-29 01:03:07,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:03:07,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:03:07,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:03:07,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:03:07,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,366 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-11-29 01:03:07,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:03:07,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:03:07,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:03:07,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:03:07,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,394 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 01:03:07,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:03:07,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:03:07,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:03:07,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:03:07,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (1/1) ... [2023-11-29 01:03:07,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:03:07,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:03:07,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:03:07,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:03:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:03:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:03:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:03:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:03:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:03:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:03:07,535 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:03:07,537 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:03:07,774 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:03:07,816 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:03:07,816 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:03:07,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:03:07 BoogieIcfgContainer [2023-11-29 01:03:07,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:03:07,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:03:07,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:03:07,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:03:07,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:03:07" (1/3) ... [2023-11-29 01:03:07,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518264c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:03:07, skipping insertion in model container [2023-11-29 01:03:07,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:03:07" (2/3) ... [2023-11-29 01:03:07,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518264c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:03:07, skipping insertion in model container [2023-11-29 01:03:07,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:03:07" (3/3) ... [2023-11-29 01:03:07,827 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-32.i [2023-11-29 01:03:07,842 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:03:07,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:03:07,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:03:07,891 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;@136a72e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:03:07,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:03:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 01:03:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 01:03:07,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:07,924 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:07,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:03:07,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash 887830059, now seen corresponding path program 1 times [2023-11-29 01:03:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520848122] [2023-11-29 01:03:07,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:03:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:03:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:03:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:03:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:03:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:03:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:03:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:03:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:03:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:03:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:03:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:03:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:03:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:03:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:03:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:03:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:03:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:03:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:03:08,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520848122] [2023-11-29 01:03:08,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520848122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:08,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:03:08,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:03:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182027263] [2023-11-29 01:03:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:08,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:03:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:08,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:03:08,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:03:08,499 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:08,651 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2023-11-29 01:03:08,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:03:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2023-11-29 01:03:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:08,663 INFO L225 Difference]: With dead ends: 95 [2023-11-29 01:03:08,663 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 01:03:08,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:03:08,671 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:08,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:03:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 01:03:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-29 01:03:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 01:03:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-11-29 01:03:08,719 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2023-11-29 01:03:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:08,721 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-11-29 01:03:08,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-11-29 01:03:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 01:03:08,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:08,727 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:08,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:03:08,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:03:08,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1697176685, now seen corresponding path program 1 times [2023-11-29 01:03:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:08,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348406594] [2023-11-29 01:03:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:03:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:03:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:03:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:03:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:03:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:03:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:03:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:03:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:03:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:03:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:03:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:03:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:03:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:03:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:03:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:03:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:03:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:03:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:03:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348406594] [2023-11-29 01:03:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348406594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:03:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 01:03:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539659777] [2023-11-29 01:03:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:15,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:03:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:15,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:03:15,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:03:15,440 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 01:03:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:18,329 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2023-11-29 01:03:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 01:03:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 109 [2023-11-29 01:03:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:18,333 INFO L225 Difference]: With dead ends: 151 [2023-11-29 01:03:18,333 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 01:03:18,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 01:03:18,335 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 203 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:18,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 328 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:03:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 01:03:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2023-11-29 01:03:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 01:03:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-11-29 01:03:18,363 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 109 [2023-11-29 01:03:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:18,363 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-11-29 01:03:18,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 01:03:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-11-29 01:03:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 01:03:18,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:18,367 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:18,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:03:18,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:03:18,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1057797391, now seen corresponding path program 1 times [2023-11-29 01:03:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:18,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665327598] [2023-11-29 01:03:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:18,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:03:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:03:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:03:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:03:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:03:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:03:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:03:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:03:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:03:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:03:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:03:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:03:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:03:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:03:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:03:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:03:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:03:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:03:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:03:22,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:22,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665327598] [2023-11-29 01:03:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665327598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:22,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:03:22,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:03:22,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968611128] [2023-11-29 01:03:22,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:22,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:03:22,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:22,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:03:22,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:03:22,752 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:23,527 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2023-11-29 01:03:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:03:23,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2023-11-29 01:03:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:23,531 INFO L225 Difference]: With dead ends: 92 [2023-11-29 01:03:23,531 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 01:03:23,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:03:23,533 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:23,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 255 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:03:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 01:03:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2023-11-29 01:03:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 01:03:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2023-11-29 01:03:23,555 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 110 [2023-11-29 01:03:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:23,556 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2023-11-29 01:03:23,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2023-11-29 01:03:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 01:03:23,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:23,559 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:23,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:03:23,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:03:23,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1577699368, now seen corresponding path program 1 times [2023-11-29 01:03:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704212126] [2023-11-29 01:03:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:03:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:03:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:03:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:03:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:03:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:03:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:03:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:03:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:03:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:03:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:03:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:03:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:03:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:03:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:03:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:03:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:03:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:03:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:03:30,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:30,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704212126] [2023-11-29 01:03:30,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704212126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:30,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:03:30,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:03:30,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87493086] [2023-11-29 01:03:30,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:30,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:03:30,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:30,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:03:30,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:03:30,419 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:31,706 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2023-11-29 01:03:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:03:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-29 01:03:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:31,711 INFO L225 Difference]: With dead ends: 88 [2023-11-29 01:03:31,711 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 01:03:31,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:03:31,713 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:31,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 212 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:03:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 01:03:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2023-11-29 01:03:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 01:03:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2023-11-29 01:03:31,735 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 111 [2023-11-29 01:03:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:31,736 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2023-11-29 01:03:31,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2023-11-29 01:03:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 01:03:31,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:31,739 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:31,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:03:31,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:03:31,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash 958873527, now seen corresponding path program 1 times [2023-11-29 01:03:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:31,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976210905] [2023-11-29 01:03:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:03:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:03:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:03:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:03:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:03:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:03:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:03:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:03:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:03:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:03:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:03:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:03:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:03:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:03:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:03:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:03:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:03:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:03:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:03:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:33,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976210905] [2023-11-29 01:03:33,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976210905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:33,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:03:33,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:03:33,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950465075] [2023-11-29 01:03:33,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:33,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:03:33,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:33,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:03:33,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:03:33,733 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:34,554 INFO L93 Difference]: Finished difference Result 166 states and 238 transitions. [2023-11-29 01:03:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 01:03:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-29 01:03:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:34,556 INFO L225 Difference]: With dead ends: 166 [2023-11-29 01:03:34,556 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 01:03:34,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2023-11-29 01:03:34,558 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:34,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:03:34,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 01:03:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-11-29 01:03:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 01:03:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-11-29 01:03:34,580 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 111 [2023-11-29 01:03:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:34,580 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-11-29 01:03:34,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-11-29 01:03:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 01:03:34,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:34,583 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:34,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:03:34,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:03:34,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1016131829, now seen corresponding path program 1 times [2023-11-29 01:03:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:34,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382843004] [2023-11-29 01:03:34,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:03:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:03:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:03:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:03:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:03:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:03:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:03:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:03:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:03:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:03:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:03:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:03:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:03:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:03:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:03:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:03:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:03:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:03:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:03:38,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:38,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382843004] [2023-11-29 01:03:38,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382843004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:38,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:03:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:03:38,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685146335] [2023-11-29 01:03:38,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:38,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:03:38,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:38,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:03:38,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:03:38,422 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:38,966 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2023-11-29 01:03:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:03:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-29 01:03:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:38,968 INFO L225 Difference]: With dead ends: 102 [2023-11-29 01:03:38,968 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 01:03:38,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:03:38,969 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:38,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 216 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:03:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 01:03:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2023-11-29 01:03:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 01:03:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-11-29 01:03:38,989 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 111 [2023-11-29 01:03:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:38,990 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-11-29 01:03:38,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-11-29 01:03:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:03:38,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:38,992 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:38,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:03:38,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:03:38,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -354764027, now seen corresponding path program 1 times [2023-11-29 01:03:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:38,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511028594] [2023-11-29 01:03:38,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:03:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:03:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:03:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:03:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:03:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:03:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:03:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:03:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:03:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:03:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:03:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:03:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:03:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:03:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:03:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:03:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:03:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:03:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:03:40,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:40,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511028594] [2023-11-29 01:03:40,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511028594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:40,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:03:40,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 01:03:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447724611] [2023-11-29 01:03:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:40,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:03:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:03:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:03:40,732 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:42,654 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2023-11-29 01:03:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 01:03:42,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-11-29 01:03:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:42,655 INFO L225 Difference]: With dead ends: 90 [2023-11-29 01:03:42,655 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 01:03:42,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:03:42,656 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 67 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:42,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 383 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:03:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 01:03:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2023-11-29 01:03:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 01:03:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2023-11-29 01:03:42,676 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 112 [2023-11-29 01:03:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:42,677 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2023-11-29 01:03:42,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2023-11-29 01:03:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 01:03:42,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:42,679 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:03:42,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:03:42,679 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:03:42,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1877596512, now seen corresponding path program 1 times [2023-11-29 01:03:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:03:42,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108302960] [2023-11-29 01:03:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:03:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:03:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:03:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:03:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:03:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:03:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:03:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:03:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:03:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:03:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:03:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:03:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:03:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:03:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 01:03:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 01:03:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 01:03:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:03:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:03:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 01:03:47,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:03:47,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108302960] [2023-11-29 01:03:47,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108302960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:03:47,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:03:47,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:03:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396112047] [2023-11-29 01:03:47,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:03:47,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:03:47,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:03:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:03:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:03:47,984 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:48,632 INFO L93 Difference]: Finished difference Result 88 states and 121 transitions. [2023-11-29 01:03:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:03:48,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2023-11-29 01:03:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:48,633 INFO L225 Difference]: With dead ends: 88 [2023-11-29 01:03:48,633 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:03:48,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:03:48,635 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:48,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 214 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:03:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:03:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:03:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:03:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:03:48,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2023-11-29 01:03:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:48,636 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:03:48,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 01:03:48,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:03:48,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:03:48,639 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:03:48,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:03:48,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 01:11:35,310 WARN L293 SmtUtils]: Spent 7.78m on a formula simplification. DAG size of input: 251 DAG size of output: 537 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:11:39,900 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,901 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,901 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 01:11:39,901 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 01:11:39,901 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 01:11:39,901 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-29 01:11:39,901 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-11-29 01:11:39,901 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 63) no Hoare annotation was computed. [2023-11-29 01:11:39,901 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,902 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,902 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 64) no Hoare annotation was computed. [2023-11-29 01:11:39,902 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 60) no Hoare annotation was computed. [2023-11-29 01:11:39,902 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,902 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,902 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-11-29 01:11:39,902 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 01:11:39,902 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-29 01:11:39,903 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-11-29 01:11:39,903 INFO L895 garLoopResultBuilder]: At program point L104-2(lines 104 110) the Hoare annotation is: (let ((.cse0 (<= 0 ~last_1_var_1_6~0))) (or (and (= ~var_1_6~0 0) .cse0) (and (let ((.cse4 (* (div ~var_1_5~0 65536) 65536))) (let ((.cse3 (+ .cse4 ~var_1_4~0 ~var_1_3~0)) (.cse1 (* (div ~var_1_4~0 65536) 65536)) (.cse2 (* (div ~var_1_3~0 65536) 65536))) (or (and (= (+ .cse1 .cse2 ~var_1_1~0) (+ ~var_1_4~0 ~var_1_3~0)) (<= (+ .cse1 .cse2 ~var_1_5~0 1) .cse3)) (and (<= .cse3 (+ .cse1 .cse2 ~var_1_5~0)) (= (+ .cse4 ~var_1_1~0) ~var_1_5~0))))) .cse0 (<= 0 ~var_1_6~0)))) [2023-11-29 01:11:39,903 INFO L899 garLoopResultBuilder]: For program point L104-3(lines 104 110) no Hoare annotation was computed. [2023-11-29 01:11:39,903 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2023-11-29 01:11:39,903 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,903 INFO L895 garLoopResultBuilder]: At program point L88-1(line 88) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,903 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 57) no Hoare annotation was computed. [2023-11-29 01:11:39,904 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 01:11:39,904 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2023-11-29 01:11:39,904 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,904 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 01:11:39,904 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,904 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,904 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 01:11:39,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 01:11:39,905 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,905 INFO L895 garLoopResultBuilder]: At program point L91-1(line 91) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,905 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-11-29 01:11:39,905 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2023-11-29 01:11:39,905 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2023-11-29 01:11:39,905 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,905 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,905 INFO L899 garLoopResultBuilder]: For program point L92(lines 65 93) no Hoare annotation was computed. [2023-11-29 01:11:39,906 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,906 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (<= 0 ~last_1_var_1_6~0) (<= 0 ~var_1_6~0)) [2023-11-29 01:11:39,906 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 49) no Hoare annotation was computed. [2023-11-29 01:11:39,906 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 01:11:39,906 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 01:11:39,906 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 01:11:39,906 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 01:11:39,906 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 01:11:39,909 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:39,910 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:11:39,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:11:39 BoogieIcfgContainer [2023-11-29 01:11:39,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:11:39,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:11:39,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:11:39,923 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:11:39,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:03:07" (3/4) ... [2023-11-29 01:11:39,926 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:11:39,929 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 01:11:39,935 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 01:11:39,935 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 01:11:39,935 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:11:39,936 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:11:40,019 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:11:40,020 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:11:40,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:11:40,020 INFO L158 Benchmark]: Toolchain (without parser) took 512981.29ms. Allocated memory was 140.5MB in the beginning and 799.0MB in the end (delta: 658.5MB). Free memory was 101.6MB in the beginning and 368.7MB in the end (delta: -267.1MB). Peak memory consumption was 393.2MB. Max. memory is 16.1GB. [2023-11-29 01:11:40,021 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 140.5MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:11:40,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.88ms. Allocated memory is still 140.5MB. Free memory was 101.3MB in the beginning and 88.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:11:40,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.71ms. Allocated memory is still 140.5MB. Free memory was 88.7MB in the beginning and 85.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:11:40,021 INFO L158 Benchmark]: Boogie Preprocessor took 44.31ms. Allocated memory is still 140.5MB. Free memory was 85.7MB in the beginning and 81.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:11:40,022 INFO L158 Benchmark]: RCFGBuilder took 403.86ms. Allocated memory is still 140.5MB. Free memory was 80.8MB in the beginning and 61.0MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 01:11:40,022 INFO L158 Benchmark]: TraceAbstraction took 512103.08ms. Allocated memory was 140.5MB in the beginning and 799.0MB in the end (delta: 658.5MB). Free memory was 60.6MB in the beginning and 375.0MB in the end (delta: -314.5MB). Peak memory consumption was 433.0MB. Max. memory is 16.1GB. [2023-11-29 01:11:40,022 INFO L158 Benchmark]: Witness Printer took 96.63ms. Allocated memory is still 799.0MB. Free memory was 374.0MB in the beginning and 368.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:11:40,024 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.18ms. Allocated memory is still 140.5MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.88ms. Allocated memory is still 140.5MB. Free memory was 101.3MB in the beginning and 88.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.71ms. Allocated memory is still 140.5MB. Free memory was 88.7MB in the beginning and 85.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.31ms. Allocated memory is still 140.5MB. Free memory was 85.7MB in the beginning and 81.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 403.86ms. Allocated memory is still 140.5MB. Free memory was 80.8MB in the beginning and 61.0MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 512103.08ms. Allocated memory was 140.5MB in the beginning and 799.0MB in the end (delta: 658.5MB). Free memory was 60.6MB in the beginning and 375.0MB in the end (delta: -314.5MB). Peak memory consumption was 433.0MB. Max. memory is 16.1GB. * Witness Printer took 96.63ms. Allocated memory is still 799.0MB. Free memory was 374.0MB in the beginning and 368.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 512.0s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 471.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 1868 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1382 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1197 IncrementalHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 486 mSDtfsCounter, 1197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 166 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 85 PreInvPairs, 116 NumberOfFragments, 213 HoareAnnotationTreeSize, 85 FomulaSimplifications, 15892937 FormulaSimplificationTreeSizeReduction, 466.7s HoareSimplificationTime, 20 FomulaSimplificationsInter, 452452 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 878 ConstructedInterpolants, 0 QuantifiedInterpolants, 10622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4896/4896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((var_1_6 == 0) && (0 <= last_1_var_1_6)) || (((((((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_1) == (var_1_4 + var_1_3)) && ((((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_5) + 1) <= ((((var_1_5 / 65536) * 65536) + var_1_4) + var_1_3))) || ((((((var_1_5 / 65536) * 65536) + var_1_4) + var_1_3) <= ((((var_1_4 / 65536) * 65536) + ((var_1_3 / 65536) * 65536)) + var_1_5)) && ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))) && (0 <= last_1_var_1_6)) && (0 <= var_1_6))) RESULT: Ultimate proved your program to be correct! [2023-11-29 01:11:40,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5be7e05-3033-4b84-b6c5-3c615e4d4bbd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE