./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:45:13,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:45:13,815 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:45:13,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:45:13,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:45:13,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:45:13,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:45:13,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:45:13,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:45:13,846 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:45:13,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:45:13,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:45:13,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:45:13,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:45:13,849 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:45:13,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:45:13,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:45:13,850 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:45:13,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:45:13,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:45:13,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:45:13,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:45:13,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:45:13,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:45:13,854 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:45:13,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:45:13,855 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:45:13,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:45:13,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:45:13,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:45:13,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:45:13,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:13,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:45:13,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:45:13,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:45:13,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:45:13,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:45:13,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:45:13,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:45:13,859 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:45:13,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:45:13,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:45:13,860 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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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 -> 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c [2023-11-29 04:45:14,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:45:14,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:45:14,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:45:14,127 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:45:14,127 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:45:14,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2023-11-29 04:45:16,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:45:17,044 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:45:17,045 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2023-11-29 04:45:17,052 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/data/0772c84c7/a93f18edca0b4d31adbcf2674092551f/FLAGcd2dd85a6 [2023-11-29 04:45:17,065 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/data/0772c84c7/a93f18edca0b4d31adbcf2674092551f [2023-11-29 04:45:17,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:45:17,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:45:17,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:17,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:45:17,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:45:17,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14168102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17, skipping insertion in model container [2023-11-29 04:45:17,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,108 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:45:17,242 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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i[915,928] [2023-11-29 04:45:17,279 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:17,291 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:45:17,301 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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i[915,928] [2023-11-29 04:45:17,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:17,338 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:45:17,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17 WrapperNode [2023-11-29 04:45:17,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:17,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:45:17,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:45:17,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:45:17,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,381 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2023-11-29 04:45:17,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:45:17,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:45:17,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:45:17,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:45:17,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,410 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 04:45:17,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:45:17,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:45:17,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:45:17,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:45:17,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (1/1) ... [2023-11-29 04:45:17,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:17,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:45:17,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:45:17,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:45:17,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:45:17,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:45:17,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:45:17,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:45:17,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:45:17,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:45:17,581 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:45:17,582 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:45:17,820 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:45:17,857 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:45:17,857 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:45:17,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:17 BoogieIcfgContainer [2023-11-29 04:45:17,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:45:17,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:45:17,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:45:17,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:45:17,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:45:17" (1/3) ... [2023-11-29 04:45:17,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee751ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:45:17, skipping insertion in model container [2023-11-29 04:45:17,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:17" (2/3) ... [2023-11-29 04:45:17,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee751ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:45:17, skipping insertion in model container [2023-11-29 04:45:17,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:17" (3/3) ... [2023-11-29 04:45:17,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-85.i [2023-11-29 04:45:17,882 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:45:17,882 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:45:17,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:45:17,932 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;@6ebe24f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:45:17,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:45:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:45:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 04:45:17,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:17,949 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:17,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:45:17,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash -921619536, now seen corresponding path program 1 times [2023-11-29 04:45:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:45:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584164615] [2023-11-29 04:45:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:45:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:45:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:45:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:45:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:45:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:45:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:45:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:45:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:45:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:45:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:45:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:45:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:45:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:45:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:45:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:45:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:45:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:45:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:45:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584164615] [2023-11-29 04:45:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584164615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:18,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:45:18,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889238024] [2023-11-29 04:45:18,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:18,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:45:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:45:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:45:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:45:18,311 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:45:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:18,349 INFO L93 Difference]: Finished difference Result 111 states and 191 transitions. [2023-11-29 04:45:18,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:45:18,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2023-11-29 04:45:18,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:18,359 INFO L225 Difference]: With dead ends: 111 [2023-11-29 04:45:18,359 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 04:45:18,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 04:45:18,365 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:18,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:45:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 04:45:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 04:45:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:45:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2023-11-29 04:45:18,402 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 100 [2023-11-29 04:45:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:18,402 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2023-11-29 04:45:18,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:45:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2023-11-29 04:45:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 04:45:18,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:18,408 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:18,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:45:18,408 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:45:18,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash 622906740, now seen corresponding path program 1 times [2023-11-29 04:45:18,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:45:18,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216143680] [2023-11-29 04:45:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:18,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:45:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:45:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:45:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:45:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:45:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:45:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:45:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:45:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:45:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:45:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:45:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:45:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:45:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:45:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:45:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:45:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:45:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:45:20,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:45:20,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216143680] [2023-11-29 04:45:20,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216143680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:20,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:20,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:45:20,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304252301] [2023-11-29 04:45:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:20,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:45:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:45:20,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:45:20,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:45:20,251 INFO L87 Difference]: Start difference. First operand 54 states and 83 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:45:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:20,619 INFO L93 Difference]: Finished difference Result 150 states and 224 transitions. [2023-11-29 04:45:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:45:20,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-11-29 04:45:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:20,623 INFO L225 Difference]: With dead ends: 150 [2023-11-29 04:45:20,623 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 04:45:20,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:45:20,625 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 58 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:20,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 243 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:45:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 04:45:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2023-11-29 04:45:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 60 states have internal predecessors, (78), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:45:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2023-11-29 04:45:20,646 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 100 [2023-11-29 04:45:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:20,647 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2023-11-29 04:45:20,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:45:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2023-11-29 04:45:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 04:45:20,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:20,650 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:20,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:45:20,650 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:45:20,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 873844894, now seen corresponding path program 1 times [2023-11-29 04:45:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:45:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65741752] [2023-11-29 04:45:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:45:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:45:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:45:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:45:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:45:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:45:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:45:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:45:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:45:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:45:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:45:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:45:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:45:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:45:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:45:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:45:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:45:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:45:23,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:45:23,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65741752] [2023-11-29 04:45:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65741752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:23,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:45:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156703332] [2023-11-29 04:45:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:23,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:45:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:45:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:45:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:45:23,941 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:45:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:24,526 INFO L93 Difference]: Finished difference Result 262 states and 376 transitions. [2023-11-29 04:45:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:45:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-29 04:45:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:24,530 INFO L225 Difference]: With dead ends: 262 [2023-11-29 04:45:24,530 INFO L226 Difference]: Without dead ends: 177 [2023-11-29 04:45:24,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:45:24,531 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:24,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 215 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:45:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-29 04:45:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 124. [2023-11-29 04:45:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 95 states have internal predecessors, (130), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 04:45:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2023-11-29 04:45:24,557 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 101 [2023-11-29 04:45:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:24,558 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2023-11-29 04:45:24,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:45:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2023-11-29 04:45:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 04:45:24,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:24,560 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:24,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:45:24,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:45:24,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1409056834, now seen corresponding path program 1 times [2023-11-29 04:45:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:45:24,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806019515] [2023-11-29 04:45:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:45:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:45:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:45:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:45:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:45:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:45:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:45:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:45:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:45:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:45:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:45:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:45:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:45:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:45:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:45:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:45:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:45:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:45:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:45:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806019515] [2023-11-29 04:45:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806019515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:45:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981108543] [2023-11-29 04:45:24,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:24,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:45:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:45:24,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:45:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:45:24,662 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:45:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:24,714 INFO L93 Difference]: Finished difference Result 254 states and 368 transitions. [2023-11-29 04:45:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:45:24,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-29 04:45:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:24,716 INFO L225 Difference]: With dead ends: 254 [2023-11-29 04:45:24,716 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 04:45:24,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 04:45:24,718 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:24,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:45:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 04:45:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2023-11-29 04:45:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 96 states have (on average 1.3125) internal successors, (126), 98 states have internal predecessors, (126), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 04:45:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2023-11-29 04:45:24,740 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 101 [2023-11-29 04:45:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:24,741 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2023-11-29 04:45:24,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:45:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2023-11-29 04:45:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-29 04:45:24,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:24,743 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:24,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:45:24,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:45:24,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash 931158169, now seen corresponding path program 1 times [2023-11-29 04:45:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:45:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092026085] [2023-11-29 04:45:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:45:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:45:24,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:45:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:45:24,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:45:24,853 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:45:24,854 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:45:24,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:45:24,859 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 04:45:24,862 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:45:24,910 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-29 04:45:24,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-29 04:45:24,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite15 could not be translated [2023-11-29 04:45:24,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-29 04:45:24,912 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite15 could not be translated [2023-11-29 04:45:24,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:45:24 BoogieIcfgContainer [2023-11-29 04:45:24,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:45:24,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:45:24,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:45:24,928 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:45:24,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:17" (3/4) ... [2023-11-29 04:45:24,930 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:45:24,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:45:24,932 INFO L158 Benchmark]: Toolchain (without parser) took 7861.39ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 112.0MB in the beginning and 92.6MB in the end (delta: 19.4MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. [2023-11-29 04:45:24,932 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:45:24,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.21ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 99.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:45:24,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.03ms. Allocated memory is still 151.0MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:45:24,933 INFO L158 Benchmark]: Boogie Preprocessor took 43.80ms. Allocated memory is still 151.0MB. Free memory was 97.5MB in the beginning and 95.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:45:24,934 INFO L158 Benchmark]: RCFGBuilder took 431.07ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 77.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:45:24,934 INFO L158 Benchmark]: TraceAbstraction took 7066.01ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 76.1MB in the beginning and 93.7MB in the end (delta: -17.6MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2023-11-29 04:45:24,934 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 230.7MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:45:24,936 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 151.0MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.21ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 99.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.03ms. Allocated memory is still 151.0MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.80ms. Allocated memory is still 151.0MB. Free memory was 97.5MB in the beginning and 95.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.07ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 77.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7066.01ms. Allocated memory was 151.0MB in the beginning and 230.7MB in the end (delta: 79.7MB). Free memory was 76.1MB in the beginning and 93.7MB in the end (delta: -17.6MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 230.7MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite15 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -64; [L25] signed long int var_1_4 = -4; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed char var_1_7 = 32; [L29] signed char var_1_8 = -8; [L30] signed char var_1_9 = 10; [L31] double var_1_10 = 1.6; [L32] double var_1_11 = 127.25; [L33] double var_1_12 = 2.5; [L104] isInitial = 1 [L105] FCALL initially() [L106] int k_loop; [L107] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=0, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L107] COND TRUE k_loop < 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L75] RET assume_abort_if_not(var_1_3 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] CALL assume_abort_if_not(var_1_3 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_3 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L78] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L80] var_1_5 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L83] var_1_6 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_7=32, var_1_8=-8, var_1_9=10] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L86] var_1_8 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L87] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L88] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L88] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L89] var_1_9 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L90] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L91] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L91] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L92] var_1_11 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L93] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L94] var_1_12 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L95] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L109] RET updateVariables() [L110] CALL step() [L37] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L38] COND FALSE !(\read(var_1_6)) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L43] COND TRUE \read(var_1_2) [L44] var_1_1 = (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L56] unsigned char stepLocal_2 = var_1_5; [L57] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=-127, stepLocal_2=1, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L58] COND TRUE ! var_1_6 [L59] var_1_10 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=-127, stepLocal_2=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L110] RET step() [L111] CALL, EXPR property() [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L100] EXPR (! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L100-L101] return ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=-127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 698 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 296 IncrementalHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 347 mSDtfsCounter, 296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 67 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 1979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:45:24,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:45:26,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:45:27,007 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:45:27,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:45:27,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:45:27,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:45:27,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:45:27,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:45:27,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:45:27,046 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:45:27,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:45:27,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:45:27,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:45:27,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:45:27,049 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:45:27,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:45:27,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:45:27,050 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:45:27,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:45:27,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:45:27,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:45:27,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:45:27,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:45:27,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:45:27,054 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:45:27,055 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:45:27,055 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:45:27,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:45:27,056 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:45:27,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:45:27,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:45:27,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:45:27,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:45:27,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:27,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:45:27,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:45:27,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:45:27,059 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:45:27,059 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:45:27,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:45:27,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:45:27,060 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:45:27,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:45:27,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:45:27,061 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:45:27,061 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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/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 -> 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c [2023-11-29 04:45:27,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:45:27,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:45:27,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:45:27,372 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:45:27,372 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:45:27,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2023-11-29 04:45:30,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:45:30,399 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:45:30,400 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2023-11-29 04:45:30,410 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/data/2dc50ce25/0b5b1df3c1fd4b5ba6416e3173baa37e/FLAGbbd593609 [2023-11-29 04:45:30,425 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/data/2dc50ce25/0b5b1df3c1fd4b5ba6416e3173baa37e [2023-11-29 04:45:30,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:45:30,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:45:30,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:30,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:45:30,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:45:30,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e250094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30, skipping insertion in model container [2023-11-29 04:45:30,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,467 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:45:30,622 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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i[915,928] [2023-11-29 04:45:30,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:30,687 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:45:30,701 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_eee1ed95-a1dd-46dc-8f6b-715f5782febd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i[915,928] [2023-11-29 04:45:30,720 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:30,738 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:45:30,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30 WrapperNode [2023-11-29 04:45:30,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:30,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:45:30,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:45:30,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:45:30,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,785 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2023-11-29 04:45:30,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:45:30,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:45:30,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:45:30,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:45:30,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,816 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 04:45:30,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:45:30,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:45:30,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:45:30,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:45:30,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (1/1) ... [2023-11-29 04:45:30,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:45:30,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:45:30,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:45:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:45:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:45:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:45:30,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:45:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:45:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:45:30,990 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:45:30,993 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:45:31,238 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:45:31,289 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:45:31,289 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:45:31,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:31 BoogieIcfgContainer [2023-11-29 04:45:31,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:45:31,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:45:31,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:45:31,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:45:31,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:45:30" (1/3) ... [2023-11-29 04:45:31,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d5321d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:45:31, skipping insertion in model container [2023-11-29 04:45:31,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:30" (2/3) ... [2023-11-29 04:45:31,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d5321d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:45:31, skipping insertion in model container [2023-11-29 04:45:31,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:31" (3/3) ... [2023-11-29 04:45:31,299 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-85.i [2023-11-29 04:45:31,318 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:45:31,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:45:31,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:45:31,374 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;@3bba397a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:45:31,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:45:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:45:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 04:45:31,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:31,392 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:31,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:45:31,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1612168839, now seen corresponding path program 1 times [2023-11-29 04:45:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:31,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9860701] [2023-11-29 04:45:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:31,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:31,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:31,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:45:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:31,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:45:31,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2023-11-29 04:45:31,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:31,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9860701] [2023-11-29 04:45:31,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9860701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:31,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:31,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:45:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283230102] [2023-11-29 04:45:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:31,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:45:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:45:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:45:31,672 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:45:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:31,720 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2023-11-29 04:45:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:45:31,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2023-11-29 04:45:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:31,730 INFO L225 Difference]: With dead ends: 93 [2023-11-29 04:45:31,730 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 04:45:31,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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 04:45:31,736 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:31,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:45:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 04:45:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-29 04:45:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:45:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2023-11-29 04:45:31,775 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 98 [2023-11-29 04:45:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:31,775 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2023-11-29 04:45:31,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:45:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2023-11-29 04:45:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 04:45:31,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:31,781 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:45:31,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:45:31,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:31,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:45:31,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash 735804477, now seen corresponding path program 1 times [2023-11-29 04:45:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:31,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334278012] [2023-11-29 04:45:31,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:31,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:31,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:32,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:45:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:32,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:45:32,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 04:53:49,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:53:49,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:53:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334278012] [2023-11-29 04:53:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334278012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:49,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:53:49,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 04:53:49,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033505693] [2023-11-29 04:53:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:49,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:53:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:53:49,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:53:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:53:49,372 INFO L87 Difference]: Start difference. First operand 45 states and 68 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:53:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:52,023 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2023-11-29 04:53:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 04:53:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2023-11-29 04:53:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:52,026 INFO L225 Difference]: With dead ends: 134 [2023-11-29 04:53:52,027 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 04:53:52,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-29 04:53:52,029 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 171 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:52,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 187 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:53:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 04:53:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2023-11-29 04:53:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:53:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2023-11-29 04:53:52,046 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 98 [2023-11-29 04:53:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:52,047 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2023-11-29 04:53:52,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:53:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2023-11-29 04:53:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 04:53:52,049 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:52,049 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:53:52,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:53:52,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:53:52,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:52,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:52,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1447673797, now seen corresponding path program 1 times [2023-11-29 04:53:52,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:53:52,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60675089] [2023-11-29 04:53:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:52,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:53:52,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:53:52,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:53:52,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:53:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:52,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:53:52,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:54:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 04:54:48,020 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:54:48,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:54:48,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60675089] [2023-11-29 04:54:48,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60675089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:54:48,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:54:48,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 04:54:48,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457072784] [2023-11-29 04:54:48,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:54:48,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:54:48,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:54:48,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:54:48,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:54:48,022 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:54:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:51,417 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2023-11-29 04:54:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:54:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2023-11-29 04:54:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:51,421 INFO L225 Difference]: With dead ends: 104 [2023-11-29 04:54:51,422 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 04:54:51,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:54:51,424 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 119 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:51,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 248 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 04:54:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 04:54:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2023-11-29 04:54:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:54:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2023-11-29 04:54:51,444 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 99 [2023-11-29 04:54:51,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:51,445 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2023-11-29 04:54:51,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:54:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2023-11-29 04:54:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 04:54:51,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:51,448 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:54:51,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:54:51,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:54:51,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:51,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2045998881, now seen corresponding path program 1 times [2023-11-29 04:54:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:54:51,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355220356] [2023-11-29 04:54:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:51,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:54:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:54:51,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:54:51,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:54:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:51,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:54:51,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:54:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 04:54:51,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:54:51,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:54:51,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355220356] [2023-11-29 04:54:51,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355220356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:54:51,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:54:51,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:54:51,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60280109] [2023-11-29 04:54:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:54:51,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:54:51,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:54:51,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:54:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:54:51,766 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:54:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:51,850 INFO L93 Difference]: Finished difference Result 168 states and 228 transitions. [2023-11-29 04:54:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:54:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-11-29 04:54:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:51,853 INFO L225 Difference]: With dead ends: 168 [2023-11-29 04:54:51,853 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 04:54:51,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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 04:54:51,855 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:51,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 140 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:54:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 04:54:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2023-11-29 04:54:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:54:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2023-11-29 04:54:51,868 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 99 [2023-11-29 04:54:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:51,869 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2023-11-29 04:54:51,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 04:54:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2023-11-29 04:54:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 04:54:51,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:51,871 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:54:51,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:54:52,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:54:52,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:52,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash -215619498, now seen corresponding path program 1 times [2023-11-29 04:54:52,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:54:52,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905573269] [2023-11-29 04:54:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:52,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:54:52,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:54:52,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:54:52,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:54:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:52,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:54:52,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 04:55:47,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:55:47,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:55:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905573269] [2023-11-29 04:55:47,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905573269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:47,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:47,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 04:55:47,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694200684] [2023-11-29 04:55:47,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:47,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:55:47,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:55:47,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:55:47,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:55:47,712 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:55:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:50,536 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2023-11-29 04:55:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 04:55:50,537 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2023-11-29 04:55:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:50,539 INFO L225 Difference]: With dead ends: 102 [2023-11-29 04:55:50,539 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 04:55:50,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:55:50,541 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 161 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:50,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 207 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 04:55:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 04:55:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 64. [2023-11-29 04:55:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:55:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2023-11-29 04:55:50,553 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 100 [2023-11-29 04:55:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:50,554 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2023-11-29 04:55:50,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 04:55:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2023-11-29 04:55:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 04:55:50,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:50,557 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:50,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 04:55:50,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:50,757 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:50,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash 998395206, now seen corresponding path program 1 times [2023-11-29 04:55:50,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:55:50,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601982585] [2023-11-29 04:55:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:50,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:50,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:55:50,760 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:55:50,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eee1ed95-a1dd-46dc-8f6b-715f5782febd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:55:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:50,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:55:50,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:56:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 174 proven. 120 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-29 04:56:50,523 INFO L327 TraceCheckSpWp]: Computing backward predicates...