./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.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_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/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_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/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_db4657de-bb1c-4cce-95e3-2e5feaf8c170/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 c06336cb14a71e49257e9a1a6eb7bbafa15ea27e03c080926f8f56f04c062783 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:33:03,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:33:03,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:33:03,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:33:03,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:33:03,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:33:03,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:33:03,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:33:03,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:33:03,565 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:33:03,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:33:03,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:33:03,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:33:03,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:33:03,567 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:33:03,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:33:03,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:33:03,569 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:33:03,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:33:03,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:33:03,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:33:03,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:33:03,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:33:03,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:33:03,572 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:33:03,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:33:03,573 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:33:03,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:33:03,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:33:03,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:33:03,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:33:03,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:33:03,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:33:03,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:33:03,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:33:03,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:33:03,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:33:03,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:33:03,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:33:03,576 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:33:03,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:33:03,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:33:03,577 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_db4657de-bb1c-4cce-95e3-2e5feaf8c170/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_db4657de-bb1c-4cce-95e3-2e5feaf8c170/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 -> c06336cb14a71e49257e9a1a6eb7bbafa15ea27e03c080926f8f56f04c062783 [2023-11-29 06:33:03,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:33:03,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:33:03,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:33:03,823 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:33:03,823 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:33:03,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2023-11-29 06:33:06,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:33:06,720 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:33:06,721 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i [2023-11-29 06:33:06,730 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/data/00369b8f1/2756cc2418fd450db6266c67a7e2105e/FLAG26c69add1 [2023-11-29 06:33:06,742 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/data/00369b8f1/2756cc2418fd450db6266c67a7e2105e [2023-11-29 06:33:06,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:33:06,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:33:06,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:33:06,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:33:06,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:33:06,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:06,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0613d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06, skipping insertion in model container [2023-11-29 06:33:06,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:06,777 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:33:06,893 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_db4657de-bb1c-4cce-95e3-2e5feaf8c170/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i[917,930] [2023-11-29 06:33:06,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:33:06,946 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:33:06,957 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_db4657de-bb1c-4cce-95e3-2e5feaf8c170/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-90.i[917,930] [2023-11-29 06:33:06,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:33:06,996 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:33:06,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06 WrapperNode [2023-11-29 06:33:06,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:33:06,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:33:06,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:33:06,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:33:07,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,043 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-11-29 06:33:07,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:33:07,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:33:07,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:33:07,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:33:07,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,073 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 06:33:07,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:33:07,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:33:07,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:33:07,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:33:07,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (1/1) ... [2023-11-29 06:33:07,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:33:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:33:07,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:33:07,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:33:07,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:33:07,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:33:07,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:33:07,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:33:07,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:33:07,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:33:07,249 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:33:07,251 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:33:07,483 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:33:07,519 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:33:07,520 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:33:07,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:33:07 BoogieIcfgContainer [2023-11-29 06:33:07,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:33:07,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:33:07,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:33:07,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:33:07,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:33:06" (1/3) ... [2023-11-29 06:33:07,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e282bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:33:07, skipping insertion in model container [2023-11-29 06:33:07,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:06" (2/3) ... [2023-11-29 06:33:07,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e282bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:33:07, skipping insertion in model container [2023-11-29 06:33:07,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:33:07" (3/3) ... [2023-11-29 06:33:07,529 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-90.i [2023-11-29 06:33:07,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:33:07,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:33:07,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:33:07,590 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;@7547e2a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:33:07,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:33:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 06:33:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 06:33:07,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:07,609 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:07,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:07,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1356584365, now seen corresponding path program 1 times [2023-11-29 06:33:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:07,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447369402] [2023-11-29 06:33:07,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:07,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447369402] [2023-11-29 06:33:07,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447369402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:07,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:07,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:33:07,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786793095] [2023-11-29 06:33:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:07,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:33:07,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:08,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:33:08,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:33:08,029 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 06:33:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:08,069 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2023-11-29 06:33:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:33:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2023-11-29 06:33:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:08,079 INFO L225 Difference]: With dead ends: 99 [2023-11-29 06:33:08,079 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 06:33:08,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:33:08,086 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:08,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:33:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 06:33:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 06:33:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 06:33:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-11-29 06:33:08,128 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 120 [2023-11-29 06:33:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:08,128 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-11-29 06:33:08,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 06:33:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-11-29 06:33:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 06:33:08,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:08,133 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:08,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:33:08,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:08,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash -997376595, now seen corresponding path program 1 times [2023-11-29 06:33:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457806540] [2023-11-29 06:33:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:14,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457806540] [2023-11-29 06:33:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457806540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:14,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:33:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797094244] [2023-11-29 06:33:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:14,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:33:14,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:14,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:33:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:33:14,220 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:15,081 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2023-11-29 06:33:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:33:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-29 06:33:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:15,084 INFO L225 Difference]: With dead ends: 95 [2023-11-29 06:33:15,084 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 06:33:15,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:33:15,086 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:15,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 304 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:33:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 06:33:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2023-11-29 06:33:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 06:33:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-11-29 06:33:15,112 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2023-11-29 06:33:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:15,113 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-11-29 06:33:15,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-11-29 06:33:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 06:33:15,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:15,116 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:15,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:33:15,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:15,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash -997317013, now seen corresponding path program 1 times [2023-11-29 06:33:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220102623] [2023-11-29 06:33:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:17,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220102623] [2023-11-29 06:33:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220102623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:17,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:17,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:33:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318960820] [2023-11-29 06:33:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:17,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:33:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:33:17,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:33:17,097 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:17,832 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2023-11-29 06:33:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:33:17,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-29 06:33:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:17,835 INFO L225 Difference]: With dead ends: 93 [2023-11-29 06:33:17,835 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 06:33:17,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:33:17,836 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 84 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:17,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 311 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:33:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 06:33:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2023-11-29 06:33:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 06:33:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-11-29 06:33:17,860 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2023-11-29 06:33:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:17,861 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-11-29 06:33:17,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-11-29 06:33:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 06:33:17,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:17,863 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:17,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:33:17,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:17,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:17,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1054634897, now seen corresponding path program 1 times [2023-11-29 06:33:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928185464] [2023-11-29 06:33:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:20,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928185464] [2023-11-29 06:33:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928185464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:33:20,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883929720] [2023-11-29 06:33:20,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:20,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:33:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:33:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:33:20,739 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:21,473 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2023-11-29 06:33:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:33:21,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-29 06:33:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:21,476 INFO L225 Difference]: With dead ends: 123 [2023-11-29 06:33:21,477 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 06:33:21,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:33:21,478 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 90 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:21,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 247 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:33:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 06:33:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2023-11-29 06:33:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 06:33:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-11-29 06:33:21,503 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 120 [2023-11-29 06:33:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:21,504 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-11-29 06:33:21,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-11-29 06:33:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 06:33:21,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:21,505 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:21,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:33:21,505 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:21,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1054575315, now seen corresponding path program 1 times [2023-11-29 06:33:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:21,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247223124] [2023-11-29 06:33:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247223124] [2023-11-29 06:33:23,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247223124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:23,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:23,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:33:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156974060] [2023-11-29 06:33:23,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:23,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:33:23,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:33:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:33:23,109 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:23,730 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2023-11-29 06:33:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:33:23,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-29 06:33:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:23,732 INFO L225 Difference]: With dead ends: 115 [2023-11-29 06:33:23,732 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 06:33:23,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:33:23,734 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 84 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:23,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:33:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 06:33:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2023-11-29 06:33:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 60 states have internal predecessors, (69), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 06:33:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2023-11-29 06:33:23,765 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 120 [2023-11-29 06:33:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:23,766 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2023-11-29 06:33:23,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2023-11-29 06:33:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:33:23,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:23,768 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:23,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:33:23,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:23,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1148591013, now seen corresponding path program 1 times [2023-11-29 06:33:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908827364] [2023-11-29 06:33:23,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908827364] [2023-11-29 06:33:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908827364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:26,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:33:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582079739] [2023-11-29 06:33:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:26,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:33:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:26,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:33:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:33:26,990 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:28,236 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2023-11-29 06:33:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:33:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 06:33:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:28,239 INFO L225 Difference]: With dead ends: 148 [2023-11-29 06:33:28,239 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 06:33:28,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:33:28,240 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 120 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:28,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 331 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:33:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 06:33:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 65. [2023-11-29 06:33:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 06:33:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2023-11-29 06:33:28,261 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 121 [2023-11-29 06:33:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:28,261 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2023-11-29 06:33:28,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2023-11-29 06:33:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:33:28,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:28,263 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:28,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:33:28,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:28,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1091392293, now seen corresponding path program 1 times [2023-11-29 06:33:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:28,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379896587] [2023-11-29 06:33:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379896587] [2023-11-29 06:33:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379896587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:30,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:30,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:33:30,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982345895] [2023-11-29 06:33:30,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:30,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:33:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:30,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:33:30,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:33:30,210 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:31,508 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2023-11-29 06:33:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:33:31,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 06:33:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:31,511 INFO L225 Difference]: With dead ends: 126 [2023-11-29 06:33:31,511 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 06:33:31,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2023-11-29 06:33:31,512 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:31,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 314 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:33:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 06:33:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 64. [2023-11-29 06:33:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 06:33:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2023-11-29 06:33:31,534 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 121 [2023-11-29 06:33:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:31,535 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2023-11-29 06:33:31,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2023-11-29 06:33:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:33:31,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:31,538 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:31,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:33:31,538 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:31,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1371368921, now seen corresponding path program 1 times [2023-11-29 06:33:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:31,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550830962] [2023-11-29 06:33:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:34,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:34,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550830962] [2023-11-29 06:33:34,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550830962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:34,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:34,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:33:34,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426200452] [2023-11-29 06:33:34,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:34,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:33:34,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:34,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:33:34,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:33:34,299 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:35,016 INFO L93 Difference]: Finished difference Result 129 states and 174 transitions. [2023-11-29 06:33:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:33:35,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 06:33:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:35,018 INFO L225 Difference]: With dead ends: 129 [2023-11-29 06:33:35,018 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 06:33:35,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:33:35,019 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 145 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:35,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:33:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 06:33:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 62. [2023-11-29 06:33:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 06:33:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-11-29 06:33:35,039 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2023-11-29 06:33:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:35,039 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-11-29 06:33:35,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-11-29 06:33:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:33:35,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:35,041 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:35,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:33:35,041 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:35,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1371309339, now seen corresponding path program 1 times [2023-11-29 06:33:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534979463] [2023-11-29 06:33:35,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:36,743 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:36,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534979463] [2023-11-29 06:33:36,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534979463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:36,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:36,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:33:36,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765512552] [2023-11-29 06:33:36,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:36,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:33:36,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:36,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:33:36,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:33:36,745 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:37,421 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2023-11-29 06:33:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:33:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 06:33:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:37,423 INFO L225 Difference]: With dead ends: 125 [2023-11-29 06:33:37,423 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 06:33:37,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:33:37,424 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 131 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:37,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 252 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:33:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 06:33:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 62. [2023-11-29 06:33:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 06:33:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-11-29 06:33:37,446 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2023-11-29 06:33:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:37,447 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-11-29 06:33:37,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-11-29 06:33:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 06:33:37,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:37,448 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:37,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:33:37,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:37,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1428567641, now seen corresponding path program 1 times [2023-11-29 06:33:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753447076] [2023-11-29 06:33:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:33:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:33:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 06:33:39,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:39,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753447076] [2023-11-29 06:33:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753447076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:39,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:33:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918584019] [2023-11-29 06:33:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:39,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:33:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:39,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:33:39,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:33:39,347 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:40,239 INFO L93 Difference]: Finished difference Result 119 states and 163 transitions. [2023-11-29 06:33:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:33:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 06:33:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:40,241 INFO L225 Difference]: With dead ends: 119 [2023-11-29 06:33:40,241 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:33:40,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:33:40,242 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:33:40,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 321 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:33:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:33:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:33:40,243 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 06:33:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:33:40,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2023-11-29 06:33:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:40,244 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:33:40,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 06:33:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:33:40,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:33:40,247 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:33:40,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:33:40,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 06:33:41,721 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-29 06:33:41,721 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-29 06:33:41,721 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-29 06:33:41,721 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 06:33:41,721 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 06:33:41,721 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 06:33:41,721 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-11-29 06:33:41,721 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-11-29 06:33:41,721 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-11-29 06:33:41,722 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-29 06:33:41,722 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,722 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,722 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-11-29 06:33:41,722 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 42 72) no Hoare annotation was computed. [2023-11-29 06:33:41,722 INFO L899 garLoopResultBuilder]: For program point L103(lines 73 104) no Hoare annotation was computed. [2023-11-29 06:33:41,722 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,723 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,723 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-29 06:33:41,723 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-29 06:33:41,723 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 06:33:41,723 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-11-29 06:33:41,723 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-11-29 06:33:41,723 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2023-11-29 06:33:41,723 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-29 06:33:41,723 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-29 06:33:41,723 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-29 06:33:41,724 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,724 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,724 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-29 06:33:41,724 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-29 06:33:41,724 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 06:33:41,724 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-29 06:33:41,724 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-11-29 06:33:41,724 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-11-29 06:33:41,724 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 06:33:41,724 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-29 06:33:41,725 INFO L899 garLoopResultBuilder]: For program point L58(lines 42 72) no Hoare annotation was computed. [2023-11-29 06:33:41,725 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,725 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,725 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 72) no Hoare annotation was computed. [2023-11-29 06:33:41,725 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-29 06:33:41,725 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-11-29 06:33:41,725 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,726 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,726 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 06:33:41,726 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-29 06:33:41,726 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-29 06:33:41,726 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 06:33:41,726 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 06:33:41,726 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 06:33:41,726 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 06:33:41,729 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:33:41,731 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:33:41,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:33:41 BoogieIcfgContainer [2023-11-29 06:33:41,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:33:41,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:33:41,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:33:41,740 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:33:41,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:33:07" (3/4) ... [2023-11-29 06:33:41,742 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 06:33:41,745 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 06:33:41,751 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 06:33:41,751 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 06:33:41,752 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 06:33:41,752 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 06:33:41,833 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:33:41,834 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 06:33:41,834 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:33:41,834 INFO L158 Benchmark]: Toolchain (without parser) took 35088.84ms. Allocated memory was 163.6MB in the beginning and 360.7MB in the end (delta: 197.1MB). Free memory was 129.2MB in the beginning and 117.5MB in the end (delta: 11.7MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. [2023-11-29 06:33:41,835 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:33:41,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.83ms. Allocated memory is still 163.6MB. Free memory was 129.2MB in the beginning and 116.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 06:33:41,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.69ms. Allocated memory is still 163.6MB. Free memory was 116.6MB in the beginning and 113.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:33:41,836 INFO L158 Benchmark]: Boogie Preprocessor took 51.39ms. Allocated memory is still 163.6MB. Free memory was 113.9MB in the beginning and 134.5MB in the end (delta: -20.5MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2023-11-29 06:33:41,836 INFO L158 Benchmark]: RCFGBuilder took 423.93ms. Allocated memory is still 163.6MB. Free memory was 134.5MB in the beginning and 116.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 06:33:41,836 INFO L158 Benchmark]: TraceAbstraction took 34216.54ms. Allocated memory was 163.6MB in the beginning and 360.7MB in the end (delta: 197.1MB). Free memory was 115.6MB in the beginning and 122.7MB in the end (delta: -7.1MB). Peak memory consumption was 201.6MB. Max. memory is 16.1GB. [2023-11-29 06:33:41,837 INFO L158 Benchmark]: Witness Printer took 94.18ms. Allocated memory is still 360.7MB. Free memory was 122.7MB in the beginning and 117.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:33:41,839 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.16ms. Allocated memory is still 115.3MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.83ms. Allocated memory is still 163.6MB. Free memory was 129.2MB in the beginning and 116.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.69ms. Allocated memory is still 163.6MB. Free memory was 116.6MB in the beginning and 113.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.39ms. Allocated memory is still 163.6MB. Free memory was 113.9MB in the beginning and 134.5MB in the end (delta: -20.5MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * RCFGBuilder took 423.93ms. Allocated memory is still 163.6MB. Free memory was 134.5MB in the beginning and 116.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34216.54ms. Allocated memory was 163.6MB in the beginning and 360.7MB in the end (delta: 197.1MB). Free memory was 115.6MB in the beginning and 122.7MB in the end (delta: -7.1MB). Peak memory consumption was 201.6MB. Max. memory is 16.1GB. * Witness Printer took 94.18ms. Allocated memory is still 360.7MB. Free memory was 122.7MB in the beginning and 117.5MB 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, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 2683 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1748 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1719 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 935 mSDtfsCounter, 1719 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=4, InterpolantAutomatonStates: 108, 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, 10 MinimizatonAttempts, 313 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 79 PreInvPairs, 122 NumberOfFragments, 176 HoareAnnotationTreeSize, 79 FomulaSimplifications, 21337882 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 39099 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.8s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 9268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 7600/7600 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: 117]: Loop Invariant Derived loop invariant: ((var_1_8 + ((var_1_6 / 4294967296) * 4294967296)) == (((var_1_8 / 4294967296) * 4294967296) + var_1_6)) RESULT: Ultimate proved your program to be correct! [2023-11-29 06:33:41,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4657de-bb1c-4cce-95e3-2e5feaf8c170/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