./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.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_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/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_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/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_570572a7-e237-405f-8be3-e85f0536ce2d/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 ca7b092571e2aaa668ed3cc711eaa0aa2bd05b3934760ddf140f8cffb6c5d917 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:31:49,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:31:49,184 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:31:49,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:31:49,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:31:49,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:31:49,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:31:49,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:31:49,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:31:49,213 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:31:49,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:31:49,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:31:49,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:31:49,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:31:49,216 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:31:49,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:31:49,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:31:49,217 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:31:49,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:31:49,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:31:49,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:31:49,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:31:49,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:31:49,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:31:49,221 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:31:49,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:31:49,222 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:31:49,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:31:49,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:31:49,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:31:49,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:31:49,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:31:49,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:31:49,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:31:49,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:31:49,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:31:49,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:31:49,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:31:49,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:31:49,225 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:31:49,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:31:49,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:31:49,226 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_570572a7-e237-405f-8be3-e85f0536ce2d/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_570572a7-e237-405f-8be3-e85f0536ce2d/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 -> ca7b092571e2aaa668ed3cc711eaa0aa2bd05b3934760ddf140f8cffb6c5d917 [2023-11-29 00:31:49,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:31:49,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:31:49,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:31:49,487 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:31:49,488 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:31:49,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i [2023-11-29 00:31:52,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:31:52,388 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:31:52,389 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i [2023-11-29 00:31:52,397 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/data/6504fb14a/91812fbb489a4d4b90c8281caa72d788/FLAG1359fcf1a [2023-11-29 00:31:52,410 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/data/6504fb14a/91812fbb489a4d4b90c8281caa72d788 [2023-11-29 00:31:52,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:31:52,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:31:52,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:31:52,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:31:52,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:31:52,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b9be53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52, skipping insertion in model container [2023-11-29 00:31:52,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,445 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:31:52,568 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_570572a7-e237-405f-8be3-e85f0536ce2d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i[916,929] [2023-11-29 00:31:52,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:31:52,623 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:31:52,633 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_570572a7-e237-405f-8be3-e85f0536ce2d/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i[916,929] [2023-11-29 00:31:52,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:31:52,675 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:31:52,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52 WrapperNode [2023-11-29 00:31:52,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:31:52,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:31:52,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:31:52,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:31:52,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,726 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-11-29 00:31:52,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:31:52,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:31:52,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:31:52,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:31:52,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,759 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 00:31:52,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:31:52,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:31:52,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:31:52,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:31:52,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (1/1) ... [2023-11-29 00:31:52,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:31:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:31:52,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:31:52,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:31:52,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:31:52,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:31:52,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:31:52,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:31:52,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:31:52,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:31:52,933 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:31:52,936 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:31:53,192 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:31:53,234 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:31:53,235 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:31:53,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:31:53 BoogieIcfgContainer [2023-11-29 00:31:53,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:31:53,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:31:53,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:31:53,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:31:53,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:31:52" (1/3) ... [2023-11-29 00:31:53,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f38d40c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:31:53, skipping insertion in model container [2023-11-29 00:31:53,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:31:52" (2/3) ... [2023-11-29 00:31:53,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f38d40c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:31:53, skipping insertion in model container [2023-11-29 00:31:53,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:31:53" (3/3) ... [2023-11-29 00:31:53,243 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-38.i [2023-11-29 00:31:53,258 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:31:53,258 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:31:53,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:31:53,308 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;@2ab630a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:31:53,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:31:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 00:31:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 00:31:53,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:53,327 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:31:53,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:53,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 596099555, now seen corresponding path program 1 times [2023-11-29 00:31:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:31:53,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150746537] [2023-11-29 00:31:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:31:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:31:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:31:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:31:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:31:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:31:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:31:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:31:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:31:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:31:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:31:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:31:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:31:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:31:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:31:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:31:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:31:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:31:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:31:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:31:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:31:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:31:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:31:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:31:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:31:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:31:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:31:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:31:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 00:31:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:31:53,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:31:53,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150746537] [2023-11-29 00:31:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150746537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:53,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:31:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226002762] [2023-11-29 00:31:53,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:53,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:31:53,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:31:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:31:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:31:53,789 INFO L87 Difference]: Start difference. First operand has 61 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 00:31:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:53,843 INFO L93 Difference]: Finished difference Result 119 states and 216 transitions. [2023-11-29 00:31:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:31:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 164 [2023-11-29 00:31:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:53,852 INFO L225 Difference]: With dead ends: 119 [2023-11-29 00:31:53,852 INFO L226 Difference]: Without dead ends: 59 [2023-11-29 00:31:53,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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 00:31:53,859 INFO L413 NwaCegarLoop]: 87 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, 87 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 00:31:53,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:31:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-29 00:31:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-29 00:31:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 00:31:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2023-11-29 00:31:53,901 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 164 [2023-11-29 00:31:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:53,902 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2023-11-29 00:31:53,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 00:31:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2023-11-29 00:31:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 00:31:53,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:53,906 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:31:53,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:31:53,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:53,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 743422435, now seen corresponding path program 1 times [2023-11-29 00:31:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:31:53,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739446040] [2023-11-29 00:31:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:31:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:31:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:31:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:31:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:31:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:31:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:31:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:31:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:31:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:31:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:31:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:31:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:31:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:31:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:31:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:31:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:31:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:31:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:31:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:31:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:31:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:31:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:31:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:31:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:31:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:31:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:31:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:31:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 00:31:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:31:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:31:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739446040] [2023-11-29 00:31:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739446040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:31:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149537238] [2023-11-29 00:31:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:54,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:31:54,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:31:54,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:31:54,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:31:54,176 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:31:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:54,228 INFO L93 Difference]: Finished difference Result 153 states and 231 transitions. [2023-11-29 00:31:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:31:54,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 164 [2023-11-29 00:31:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:54,232 INFO L225 Difference]: With dead ends: 153 [2023-11-29 00:31:54,232 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 00:31:54,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:31:54,235 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 49 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:31:54,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:31:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 00:31:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2023-11-29 00:31:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 00:31:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2023-11-29 00:31:54,261 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 164 [2023-11-29 00:31:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:54,262 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions. [2023-11-29 00:31:54,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:31:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2023-11-29 00:31:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 00:31:54,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:54,289 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:31:54,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:31:54,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:54,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash 743482017, now seen corresponding path program 1 times [2023-11-29 00:31:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:31:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160725839] [2023-11-29 00:31:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:31:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:31:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:31:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:31:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:31:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:31:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:31:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:31:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:31:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:31:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:31:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:31:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:31:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:31:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:31:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:31:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:31:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:31:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:31:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:31:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:31:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:31:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:31:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:31:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:31:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:31:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:31:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:31:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 00:31:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:31:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:31:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160725839] [2023-11-29 00:31:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160725839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:59,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:31:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012430572] [2023-11-29 00:31:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:59,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:31:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:31:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:31:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:31:59,554 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:32:00,307 INFO L93 Difference]: Finished difference Result 118 states and 169 transitions. [2023-11-29 00:32:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:32:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 164 [2023-11-29 00:32:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:32:00,313 INFO L225 Difference]: With dead ends: 118 [2023-11-29 00:32:00,313 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 00:32:00,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:32:00,315 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 46 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:32:00,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 305 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:32:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 00:32:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2023-11-29 00:32:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 00:32:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2023-11-29 00:32:00,339 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 164 [2023-11-29 00:32:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:32:00,340 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2023-11-29 00:32:00,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2023-11-29 00:32:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 00:32:00,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:32:00,344 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:32:00,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:32:00,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:32:00,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:32:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash -65864609, now seen corresponding path program 1 times [2023-11-29 00:32:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:32:00,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236649766] [2023-11-29 00:32:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:32:00,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:32:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:32:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:32:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:32:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:32:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:32:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:32:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:32:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:32:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:32:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:32:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:32:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:32:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:32:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:32:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:32:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:32:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:32:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:32:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:32:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:32:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:32:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:32:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:32:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:32:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:32:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:32:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:32:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 00:32:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:32:04,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:32:04,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236649766] [2023-11-29 00:32:04,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236649766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:32:04,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:32:04,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:32:04,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423277551] [2023-11-29 00:32:04,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:32:04,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:32:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:32:04,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:32:04,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:32:04,245 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:32:04,732 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2023-11-29 00:32:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:32:04,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 164 [2023-11-29 00:32:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:32:04,735 INFO L225 Difference]: With dead ends: 107 [2023-11-29 00:32:04,735 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 00:32:04,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:32:04,736 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 26 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:32:04,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 332 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:32:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 00:32:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2023-11-29 00:32:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 50 states have internal predecessors, (55), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 00:32:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2023-11-29 00:32:04,763 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 164 [2023-11-29 00:32:04,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:32:04,764 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2023-11-29 00:32:04,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2023-11-29 00:32:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 00:32:04,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:32:04,767 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:32:04,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:32:04,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:32:04,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:32:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1068649076, now seen corresponding path program 1 times [2023-11-29 00:32:04,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:32:04,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213312932] [2023-11-29 00:32:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:32:04,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:32:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:32:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:32:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:32:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:32:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:32:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:32:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:32:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:32:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:32:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:32:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:32:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:32:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:32:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:32:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:32:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:32:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:32:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:32:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:32:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:32:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:32:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:32:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:32:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:32:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:32:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:32:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:32:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 00:32:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:32:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:32:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213312932] [2023-11-29 00:32:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213312932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:32:10,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:32:10,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:32:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108956666] [2023-11-29 00:32:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:32:10,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:32:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:32:10,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:32:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:32:10,747 INFO L87 Difference]: Start difference. First operand 96 states and 143 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:32:11,552 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2023-11-29 00:32:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:32:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 165 [2023-11-29 00:32:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:32:11,555 INFO L225 Difference]: With dead ends: 213 [2023-11-29 00:32:11,555 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 00:32:11,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:32:11,557 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 39 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:32:11,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 314 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:32:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 00:32:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2023-11-29 00:32:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 57 states have internal predecessors, (64), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 00:32:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2023-11-29 00:32:11,580 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 165 [2023-11-29 00:32:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:32:11,581 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2023-11-29 00:32:11,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2023-11-29 00:32:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 00:32:11,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:32:11,584 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:32:11,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:32:11,584 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:32:11,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:32:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1068589494, now seen corresponding path program 1 times [2023-11-29 00:32:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:32:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381689612] [2023-11-29 00:32:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:32:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:32:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:32:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:32:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:32:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:32:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:32:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:32:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:32:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:32:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:32:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:32:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:32:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:32:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:32:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:32:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:32:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:32:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:32:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:32:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:32:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:32:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:32:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:32:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:32:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:32:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:32:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:32:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:32:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 00:32:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:32:19,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:32:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381689612] [2023-11-29 00:32:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381689612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:32:19,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:32:19,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:32:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829754244] [2023-11-29 00:32:19,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:32:19,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:32:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:32:19,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:32:19,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:32:19,086 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:32:19,904 INFO L93 Difference]: Finished difference Result 116 states and 165 transitions. [2023-11-29 00:32:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:32:19,905 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 165 [2023-11-29 00:32:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:32:19,907 INFO L225 Difference]: With dead ends: 116 [2023-11-29 00:32:19,907 INFO L226 Difference]: Without dead ends: 114 [2023-11-29 00:32:19,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:32:19,908 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:32:19,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 290 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:32:19,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-29 00:32:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2023-11-29 00:32:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 57 states have internal predecessors, (64), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 00:32:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2023-11-29 00:32:19,928 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 165 [2023-11-29 00:32:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:32:19,929 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2023-11-29 00:32:19,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2023-11-29 00:32:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 00:32:19,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:32:19,933 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:32:19,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:32:19,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:32:19,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:32:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -388590706, now seen corresponding path program 1 times [2023-11-29 00:32:19,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:32:19,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929629000] [2023-11-29 00:32:19,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:32:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:32:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:32:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:32:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:32:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:32:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:32:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:32:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:32:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:32:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:32:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:32:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:32:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:32:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:32:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:32:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:32:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:32:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:32:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:32:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:32:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:32:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:32:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:32:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:32:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:32:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:32:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:32:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:32:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 00:32:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:32:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:32:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929629000] [2023-11-29 00:32:33,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929629000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:32:33,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:32:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:32:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974044121] [2023-11-29 00:32:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:32:33,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:32:33,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:32:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:32:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:32:33,392 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:32:42,901 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2023-11-29 00:32:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 00:32:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 165 [2023-11-29 00:32:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:32:42,904 INFO L225 Difference]: With dead ends: 213 [2023-11-29 00:32:42,904 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 00:32:42,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:32:42,905 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 30 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:32:42,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 399 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:32:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 00:32:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2023-11-29 00:32:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 00:32:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2023-11-29 00:32:42,923 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 165 [2023-11-29 00:32:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:32:42,924 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2023-11-29 00:32:42,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2023-11-29 00:32:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 00:32:42,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:32:42,926 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:32:42,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:32:42,927 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:32:42,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:32:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash -388531124, now seen corresponding path program 1 times [2023-11-29 00:32:42,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:32:42,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949571027] [2023-11-29 00:32:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:32:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:32:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:32:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:32:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:32:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:32:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:32:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:32:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:32:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:32:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:32:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:32:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:32:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:32:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:32:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:32:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:32:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:32:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:32:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:32:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:32:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:32:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:32:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 00:32:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:32:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:32:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 00:32:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 00:32:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 00:32:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 00:32:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:32:53,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:32:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949571027] [2023-11-29 00:32:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949571027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:32:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:32:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:32:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790067033] [2023-11-29 00:32:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:32:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:32:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:32:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:32:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:32:53,731 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:58,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:32:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:32:58,979 INFO L93 Difference]: Finished difference Result 104 states and 151 transitions. [2023-11-29 00:32:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:32:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 165 [2023-11-29 00:32:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:32:58,980 INFO L225 Difference]: With dead ends: 104 [2023-11-29 00:32:58,980 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:32:58,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:32:58,981 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 25 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:32:58,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 245 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 00:32:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:32:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:32:58,982 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 00:32:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:32:58,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2023-11-29 00:32:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:32:58,983 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:32:58,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 00:32:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:32:58,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:32:58,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:32:58,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:32:58,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:33:00,023 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-29 00:33:00,023 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-29 00:33:00,023 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 62) no Hoare annotation was computed. [2023-11-29 00:33:00,023 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-29 00:33:00,023 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 00:33:00,023 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 00:33:00,023 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 00:33:00,024 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-11-29 00:33:00,024 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-11-29 00:33:00,024 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-11-29 00:33:00,024 INFO L902 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: true [2023-11-29 00:33:00,024 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-29 00:33:00,024 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-29 00:33:00,024 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 50 58) no Hoare annotation was computed. [2023-11-29 00:33:00,024 INFO L902 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: true [2023-11-29 00:33:00,024 INFO L902 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: true [2023-11-29 00:33:00,024 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2023-11-29 00:33:00,024 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-29 00:33:00,024 INFO L902 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: true [2023-11-29 00:33:00,024 INFO L902 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: true [2023-11-29 00:33:00,025 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-29 00:33:00,025 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-11-29 00:33:00,025 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 46 48) no Hoare annotation was computed. [2023-11-29 00:33:00,025 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:33:00,025 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-11-29 00:33:00,025 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-11-29 00:33:00,025 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-29 00:33:00,025 INFO L902 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: true [2023-11-29 00:33:00,025 INFO L902 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: true [2023-11-29 00:33:00,025 INFO L902 garLoopResultBuilder]: At program point L105-1(line 105) the Hoare annotation is: true [2023-11-29 00:33:00,026 INFO L902 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: true [2023-11-29 00:33:00,026 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-29 00:33:00,026 INFO L902 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: true [2023-11-29 00:33:00,026 INFO L902 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: true [2023-11-29 00:33:00,026 INFO L899 garLoopResultBuilder]: For program point L106(lines 64 107) no Hoare annotation was computed. [2023-11-29 00:33:00,026 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-11-29 00:33:00,026 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-29 00:33:00,026 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-29 00:33:00,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 00:33:00,026 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-29 00:33:00,027 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-11-29 00:33:00,027 INFO L902 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: true [2023-11-29 00:33:00,027 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-11-29 00:33:00,027 INFO L902 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: true [2023-11-29 00:33:00,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:33:00,027 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-29 00:33:00,027 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 58) no Hoare annotation was computed. [2023-11-29 00:33:00,027 INFO L902 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: true [2023-11-29 00:33:00,027 INFO L902 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: true [2023-11-29 00:33:00,027 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-29 00:33:00,028 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-29 00:33:00,028 INFO L902 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: true [2023-11-29 00:33:00,028 INFO L902 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: true [2023-11-29 00:33:00,029 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (or (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0) (let ((.cse12 (div ~var_1_2~0 65536)) (.cse10 (div ~var_1_3~0 65536))) (let ((.cse6 (* .cse10 65536)) (.cse9 (* 65536 .cse12)) (.cse3 (* ~var_1_4~0 65535))) (let ((.cse8 (+ (* (div (+ .cse3 ~var_1_2~0) 65536) 65536) ~var_1_1~0)) (.cse7 (+ .cse9 ~var_1_3~0 1)) (.cse4 (* (div ~var_1_1~0 65536) 65536)) (.cse2 (+ (* 65536 (div (+ .cse3 ~var_1_3~0) 65536)) ~var_1_1~0)) (.cse1 (+ .cse6 ~var_1_2~0)) (.cse0 (+ .cse9 ~var_1_3~0)) (.cse5 (* (div ~var_1_4~0 65536) 65536))) (and (or (< .cse0 .cse1) (< .cse2 (+ .cse3 ~var_1_3~0 .cse4 1))) (<= (+ .cse5 ~var_1_3~0) (+ .cse6 ~var_1_4~0 ~var_1_1~0)) (= (+ ~var_1_9~0 ~var_1_8~0 ~var_1_11~0 ~var_1_10~0) ~var_1_7~0) (or (< .cse1 .cse7) (< .cse8 (+ .cse3 ~var_1_2~0 .cse4 1))) (or (and (<= (+ .cse3 ~var_1_2~0 .cse4) .cse8) (<= .cse7 .cse1)) (and (<= (+ .cse3 ~var_1_3~0 .cse4) .cse2) (<= .cse1 .cse0))) (or (< (+ .cse9 ~var_1_4~0) (+ .cse5 ~var_1_2~0 1)) (let ((.cse11 (* 4294967295 ~var_1_3~0)) (.cse13 (* 4294967295 ~var_1_2~0))) (= (+ (* (div (+ (* (- 281474976645120) .cse10) 2144048120 .cse11 (* (- 281474976645120) .cse12) .cse13 ~var_1_6~0) 4294967296) 4294967296) (* .cse12 281474976645120) (* .cse10 281474976645120) ~var_1_5~0) (+ (* (div ~var_1_5~0 4294967296) 4294967296) 2144048120 .cse11 .cse13 ~var_1_6~0))))))))) [2023-11-29 00:33:00,029 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-29 00:33:00,029 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-29 00:33:00,029 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 63) no Hoare annotation was computed. [2023-11-29 00:33:00,029 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 00:33:00,030 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 00:33:00,030 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 00:33:00,030 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 00:33:00,033 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:33:00,035 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:33:00,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:33:00 BoogieIcfgContainer [2023-11-29 00:33:00,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:33:00,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:33:00,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:33:00,052 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:33:00,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:31:53" (3/4) ... [2023-11-29 00:33:00,054 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:33:00,058 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 00:33:00,065 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 00:33:00,066 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 00:33:00,066 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:33:00,067 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:33:00,177 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:33:00,178 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:33:00,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:33:00,178 INFO L158 Benchmark]: Toolchain (without parser) took 67764.07ms. Allocated memory was 148.9MB in the beginning and 339.7MB in the end (delta: 190.8MB). Free memory was 105.7MB in the beginning and 142.6MB in the end (delta: -36.9MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. [2023-11-29 00:33:00,179 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:33:00,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.94ms. Allocated memory is still 148.9MB. Free memory was 105.7MB in the beginning and 92.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:33:00,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.70ms. Allocated memory is still 148.9MB. Free memory was 92.5MB in the beginning and 89.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:33:00,180 INFO L158 Benchmark]: Boogie Preprocessor took 50.80ms. Allocated memory is still 148.9MB. Free memory was 89.6MB in the beginning and 84.8MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:33:00,180 INFO L158 Benchmark]: RCFGBuilder took 456.29ms. Allocated memory is still 148.9MB. Free memory was 84.8MB in the beginning and 63.1MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:33:00,180 INFO L158 Benchmark]: TraceAbstraction took 66812.67ms. Allocated memory was 148.9MB in the beginning and 339.7MB in the end (delta: 190.8MB). Free memory was 62.5MB in the beginning and 148.9MB in the end (delta: -86.5MB). Peak memory consumption was 151.9MB. Max. memory is 16.1GB. [2023-11-29 00:33:00,181 INFO L158 Benchmark]: Witness Printer took 126.74ms. Allocated memory is still 339.7MB. Free memory was 148.9MB in the beginning and 142.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:33:00,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.94ms. Allocated memory is still 148.9MB. Free memory was 105.7MB in the beginning and 92.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.70ms. Allocated memory is still 148.9MB. Free memory was 92.5MB in the beginning and 89.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.80ms. Allocated memory is still 148.9MB. Free memory was 89.6MB in the beginning and 84.8MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 456.29ms. Allocated memory is still 148.9MB. Free memory was 84.8MB in the beginning and 63.1MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 66812.67ms. Allocated memory was 148.9MB in the beginning and 339.7MB in the end (delta: 190.8MB). Free memory was 62.5MB in the beginning and 148.9MB in the end (delta: -86.5MB). Peak memory consumption was 151.9MB. Max. memory is 16.1GB. * Witness Printer took 126.74ms. Allocated memory is still 339.7MB. Free memory was 148.9MB in the beginning and 142.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.7s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 2137 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1465 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 672 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=5, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 217 PreInvPairs, 265 NumberOfFragments, 285 HoareAnnotationTreeSize, 217 FomulaSimplifications, 141288 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 30 FomulaSimplificationsInter, 1592 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 47.0s InterpolantComputationTime, 1316 NumberOfCodeBlocks, 1316 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1308 ConstructedInterpolants, 0 QuantifiedInterpolants, 12447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12096/12096 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_13 / 256) * 256) == var_1_13) || (((((((((65536 * (var_1_2 / 65536)) + var_1_3) < (((var_1_3 / 65536) * 65536) + var_1_2)) || (((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) + 1))) && ((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_3 / 65536) * 65536) + var_1_2) < (((65536 * (var_1_2 / 65536)) + var_1_3) + 1)) || ((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) + 1)))) && ((((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) <= (((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))) || (((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) <= ((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1)) && ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6))))) RESULT: Ultimate proved your program to be correct! [2023-11-29 00:33:00,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570572a7-e237-405f-8be3-e85f0536ce2d/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