./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:37:37,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:37:37,330 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:37:37,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:37:37,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:37:37,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:37:37,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:37:37,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:37:37,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:37:37,362 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:37:37,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:37:37,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:37:37,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:37:37,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:37:37,365 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:37:37,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:37:37,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:37:37,366 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:37:37,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:37:37,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:37:37,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:37:37,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:37:37,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:37:37,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:37:37,370 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:37:37,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:37:37,370 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:37:37,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:37:37,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:37:37,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:37:37,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:37:37,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:37:37,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:37:37,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:37:37,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:37:37,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:37:37,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:37:37,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:37:37,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:37:37,376 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:37:37,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:37:37,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:37:37,377 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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2023-11-28 20:37:37,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:37:37,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:37:37,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:37:37,626 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:37:37,627 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:37:37,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-28 20:37:40,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:37:40,675 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:37:40,675 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-28 20:37:40,684 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/data/a8c84e2d9/7dea35fc519b48118254d817255ea5cc/FLAG5f32f1913 [2023-11-28 20:37:40,698 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/data/a8c84e2d9/7dea35fc519b48118254d817255ea5cc [2023-11-28 20:37:40,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:37:40,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:37:40,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:37:40,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:37:40,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:37:40,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:40,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e88d833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40, skipping insertion in model container [2023-11-28 20:37:40,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:40,734 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:37:40,866 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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2023-11-28 20:37:40,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:37:40,919 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:37:40,930 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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2023-11-28 20:37:40,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:37:40,971 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:37:40,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40 WrapperNode [2023-11-28 20:37:40,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:37:40,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:37:40,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:37:40,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:37:40,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:40,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,022 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2023-11-28 20:37:41,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:37:41,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:37:41,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:37:41,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:37:41,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,055 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-28 20:37:41,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:37:41,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:37:41,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:37:41,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:37:41,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (1/1) ... [2023-11-28 20:37:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:37:41,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:37:41,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:37:41,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:37:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:37:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:37:41,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:37:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:37:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:37:41,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:37:41,204 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:37:41,206 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:37:41,505 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:37:41,535 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:37:41,536 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:37:41,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:41 BoogieIcfgContainer [2023-11-28 20:37:41,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:37:41,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:37:41,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:37:41,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:37:41,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:37:40" (1/3) ... [2023-11-28 20:37:41,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea08d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:37:41, skipping insertion in model container [2023-11-28 20:37:41,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:40" (2/3) ... [2023-11-28 20:37:41,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea08d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:37:41, skipping insertion in model container [2023-11-28 20:37:41,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:41" (3/3) ... [2023-11-28 20:37:41,545 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-28 20:37:41,560 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:37:41,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:37:41,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:37:41,611 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;@70618362, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:37:41,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:37:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 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-28 20:37:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-28 20:37:41,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:41,629 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-28 20:37:41,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:41,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:41,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1069761762, now seen corresponding path program 1 times [2023-11-28 20:37:41,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:41,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563293528] [2023-11-28 20:37:41,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:41,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,952 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-28 20:37:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563293528] [2023-11-28 20:37:41,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563293528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:41,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:41,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:37:41,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914037431] [2023-11-28 20:37:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:41,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:37:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:37:41,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:37:41,991 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 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), 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-28 20:37:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:42,025 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2023-11-28 20:37:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:37:42,028 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), 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 102 [2023-11-28 20:37:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:42,037 INFO L225 Difference]: With dead ends: 109 [2023-11-28 20:37:42,037 INFO L226 Difference]: Without dead ends: 54 [2023-11-28 20:37:42,041 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-28 20:37:42,045 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:42,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:37:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-28 20:37:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-28 20:37:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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-28 20:37:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2023-11-28 20:37:42,093 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 102 [2023-11-28 20:37:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:42,094 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2023-11-28 20:37:42,094 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), 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-28 20:37:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2023-11-28 20:37:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-28 20:37:42,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:42,098 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-28 20:37:42,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:37:42,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:42,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1715067678, now seen corresponding path program 1 times [2023-11-28 20:37:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:42,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086440687] [2023-11-28 20:37:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,321 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-28 20:37:42,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:42,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086440687] [2023-11-28 20:37:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086440687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:37:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458468539] [2023-11-28 20:37:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:42,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:37:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:37:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:37:42,327 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-28 20:37:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:42,368 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2023-11-28 20:37:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:37:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 102 [2023-11-28 20:37:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:42,372 INFO L225 Difference]: With dead ends: 129 [2023-11-28 20:37:42,372 INFO L226 Difference]: Without dead ends: 76 [2023-11-28 20:37:42,373 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-28 20:37:42,375 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 30 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:42,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:37:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-28 20:37:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2023-11-28 20:37:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 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-28 20:37:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2023-11-28 20:37:42,389 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 102 [2023-11-28 20:37:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:42,391 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2023-11-28 20:37:42,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-28 20:37:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2023-11-28 20:37:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-28 20:37:42,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:42,394 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-28 20:37:42,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:37:42,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:42,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1878835040, now seen corresponding path program 1 times [2023-11-28 20:37:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:42,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202166348] [2023-11-28 20:37:42,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,602 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-28 20:37:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202166348] [2023-11-28 20:37:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202166348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:42,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:42,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:37:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469333127] [2023-11-28 20:37:42,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:42,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:37:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:42,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:37:42,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:37:42,606 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-28 20:37:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:42,654 INFO L93 Difference]: Finished difference Result 109 states and 165 transitions. [2023-11-28 20:37:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:37:42,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 102 [2023-11-28 20:37:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:42,657 INFO L225 Difference]: With dead ends: 109 [2023-11-28 20:37:42,657 INFO L226 Difference]: Without dead ends: 55 [2023-11-28 20:37:42,658 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-28 20:37:42,659 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:42,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 132 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:37:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-28 20:37:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-28 20:37:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 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-28 20:37:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2023-11-28 20:37:42,669 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 102 [2023-11-28 20:37:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:42,670 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2023-11-28 20:37:42,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-28 20:37:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2023-11-28 20:37:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-28 20:37:42,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:42,672 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, 1, 1] [2023-11-28 20:37:42,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:37:42,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:42,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1785126821, now seen corresponding path program 1 times [2023-11-28 20:37:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:42,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011387911] [2023-11-28 20:37:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,216 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-28 20:37:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011387911] [2023-11-28 20:37:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011387911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:43,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:43,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:37:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750068975] [2023-11-28 20:37:43,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:43,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:37:43,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:43,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:37:43,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:37:43,221 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-28 20:37:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:43,341 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2023-11-28 20:37:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:37:43,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 104 [2023-11-28 20:37:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:43,344 INFO L225 Difference]: With dead ends: 131 [2023-11-28 20:37:43,345 INFO L226 Difference]: Without dead ends: 77 [2023-11-28 20:37:43,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:37:43,347 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:43,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 183 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:37:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-28 20:37:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-11-28 20:37:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 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-28 20:37:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2023-11-28 20:37:43,357 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 104 [2023-11-28 20:37:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:43,358 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2023-11-28 20:37:43,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-28 20:37:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2023-11-28 20:37:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-28 20:37:43,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:43,360 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, 1, 1, 1] [2023-11-28 20:37:43,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:37:43,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:43,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1595104073, now seen corresponding path program 1 times [2023-11-28 20:37:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526632540] [2023-11-28 20:37:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,580 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-28 20:37:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526632540] [2023-11-28 20:37:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526632540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:43,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:37:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586529051] [2023-11-28 20:37:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:37:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:37:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:37:43,583 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-28 20:37:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:43,652 INFO L93 Difference]: Finished difference Result 182 states and 271 transitions. [2023-11-28 20:37:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:37:43,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 105 [2023-11-28 20:37:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:43,655 INFO L225 Difference]: With dead ends: 182 [2023-11-28 20:37:43,655 INFO L226 Difference]: Without dead ends: 118 [2023-11-28 20:37:43,656 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-28 20:37:43,657 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 44 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:43,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 146 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:37:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-28 20:37:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2023-11-28 20:37:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-28 20:37:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2023-11-28 20:37:43,679 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 105 [2023-11-28 20:37:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:43,680 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2023-11-28 20:37:43,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-28 20:37:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2023-11-28 20:37:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-28 20:37:43,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:43,682 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, 1, 1, 1] [2023-11-28 20:37:43,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:37:43,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:43,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash -213981125, now seen corresponding path program 1 times [2023-11-28 20:37:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837745167] [2023-11-28 20:37:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,972 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-28 20:37:44,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:44,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837745167] [2023-11-28 20:37:44,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837745167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:44,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:44,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:37:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968000631] [2023-11-28 20:37:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:44,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:37:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:37:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:37:44,975 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-28 20:37:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:45,576 INFO L93 Difference]: Finished difference Result 403 states and 581 transitions. [2023-11-28 20:37:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:37:45,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2023-11-28 20:37:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:45,579 INFO L225 Difference]: With dead ends: 403 [2023-11-28 20:37:45,579 INFO L226 Difference]: Without dead ends: 289 [2023-11-28 20:37:45,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:37:45,582 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 218 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:45,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 423 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:37:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-11-28 20:37:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 219. [2023-11-28 20:37:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 150 states have (on average 1.28) internal successors, (192), 150 states have internal predecessors, (192), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-28 20:37:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2023-11-28 20:37:45,617 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 105 [2023-11-28 20:37:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:45,618 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2023-11-28 20:37:45,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-28 20:37:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2023-11-28 20:37:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-28 20:37:45,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:45,619 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, 1, 1, 1, 1, 1] [2023-11-28 20:37:45,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:37:45,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:45,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash -123214019, now seen corresponding path program 1 times [2023-11-28 20:37:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944341232] [2023-11-28 20:37:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:45,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,749 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-28 20:37:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:45,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944341232] [2023-11-28 20:37:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944341232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:37:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683753956] [2023-11-28 20:37:45,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:45,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:37:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:37:45,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:37:45,753 INFO L87 Difference]: Start difference. First operand 219 states and 320 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-28 20:37:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:45,803 INFO L93 Difference]: Finished difference Result 439 states and 641 transitions. [2023-11-28 20:37:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:37:45,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 107 [2023-11-28 20:37:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:45,807 INFO L225 Difference]: With dead ends: 439 [2023-11-28 20:37:45,807 INFO L226 Difference]: Without dead ends: 221 [2023-11-28 20:37:45,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:37:45,809 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:45,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:37:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-28 20:37:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2023-11-28 20:37:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 150 states have internal predecessors, (188), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-28 20:37:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2023-11-28 20:37:45,846 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 107 [2023-11-28 20:37:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:45,847 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2023-11-28 20:37:45,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-28 20:37:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2023-11-28 20:37:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-28 20:37:45,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:45,849 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:37:45,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:37:45,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:45,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2139734824, now seen corresponding path program 1 times [2023-11-28 20:37:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:45,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010653895] [2023-11-28 20:37:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,149 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-28 20:37:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010653895] [2023-11-28 20:37:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010653895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:46,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:37:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146658752] [2023-11-28 20:37:46,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:46,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:37:46,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:46,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:37:46,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:37:46,151 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-28 20:37:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:46,416 INFO L93 Difference]: Finished difference Result 494 states and 692 transitions. [2023-11-28 20:37:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:37:46,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 109 [2023-11-28 20:37:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:46,420 INFO L225 Difference]: With dead ends: 494 [2023-11-28 20:37:46,420 INFO L226 Difference]: Without dead ends: 368 [2023-11-28 20:37:46,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:37:46,422 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:46,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 327 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:37:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-11-28 20:37:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 268. [2023-11-28 20:37:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.2362637362637363) internal successors, (225), 182 states have internal predecessors, (225), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-28 20:37:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 385 transitions. [2023-11-28 20:37:46,459 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 385 transitions. Word has length 109 [2023-11-28 20:37:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:46,459 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 385 transitions. [2023-11-28 20:37:46,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-28 20:37:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 385 transitions. [2023-11-28 20:37:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-28 20:37:46,461 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:46,461 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:37:46,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:37:46,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:46,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 123046868, now seen corresponding path program 1 times [2023-11-28 20:37:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814879941] [2023-11-28 20:37:46,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,563 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-28 20:37:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814879941] [2023-11-28 20:37:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814879941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:46,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:46,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:37:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129904796] [2023-11-28 20:37:46,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:46,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:37:46,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:46,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:37:46,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:37:46,565 INFO L87 Difference]: Start difference. First operand 268 states and 385 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-28 20:37:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:46,645 INFO L93 Difference]: Finished difference Result 496 states and 722 transitions. [2023-11-28 20:37:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:37:46,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 109 [2023-11-28 20:37:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:46,649 INFO L225 Difference]: With dead ends: 496 [2023-11-28 20:37:46,649 INFO L226 Difference]: Without dead ends: 376 [2023-11-28 20:37:46,650 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-28 20:37:46,651 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:46,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 130 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:37:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-11-28 20:37:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 256. [2023-11-28 20:37:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-28 20:37:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 371 transitions. [2023-11-28 20:37:46,690 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 371 transitions. Word has length 109 [2023-11-28 20:37:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:46,690 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 371 transitions. [2023-11-28 20:37:46,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-28 20:37:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 371 transitions. [2023-11-28 20:37:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-28 20:37:46,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:46,692 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:37:46,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:37:46,692 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:46,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash -629041456, now seen corresponding path program 1 times [2023-11-28 20:37:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:46,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338748283] [2023-11-28 20:37:46,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:46,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:49,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:49,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:49,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-28 20:37:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338748283] [2023-11-28 20:37:49,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338748283] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:37:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481693718] [2023-11-28 20:37:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:49,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:37:49,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:37:49,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:37:49,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:37:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:49,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-28 20:37:49,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:37:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 171 proven. 51 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-11-28 20:37:50,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:37:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-28 20:37:51,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481693718] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:37:51,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:37:51,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2023-11-28 20:37:51,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406748665] [2023-11-28 20:37:51,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:37:51,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-28 20:37:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:51,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-28 20:37:51,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:37:51,455 INFO L87 Difference]: Start difference. First operand 256 states and 371 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-28 20:37:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:53,557 INFO L93 Difference]: Finished difference Result 374 states and 490 transitions. [2023-11-28 20:37:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-28 20:37:53,557 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 109 [2023-11-28 20:37:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:53,560 INFO L225 Difference]: With dead ends: 374 [2023-11-28 20:37:53,560 INFO L226 Difference]: Without dead ends: 372 [2023-11-28 20:37:53,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 238 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=523, Invalid=1733, Unknown=0, NotChecked=0, Total=2256 [2023-11-28 20:37:53,562 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 315 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:53,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 268 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 20:37:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-11-28 20:37:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 314. [2023-11-28 20:37:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 219 states have (on average 1.2054794520547945) internal successors, (264), 219 states have internal predecessors, (264), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-28 20:37:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 424 transitions. [2023-11-28 20:37:53,624 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 424 transitions. Word has length 109 [2023-11-28 20:37:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:53,625 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 424 transitions. [2023-11-28 20:37:53,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-28 20:37:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 424 transitions. [2023-11-28 20:37:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-28 20:37:53,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:53,627 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:37:53,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:37:53,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-28 20:37:53,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:53,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1209278763, now seen corresponding path program 1 times [2023-11-28 20:37:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:53,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936311647] [2023-11-28 20:37:53,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:37:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:37:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:37:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:37:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:37:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:37:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:37:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:37:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:37:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:37:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:37:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:37:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-28 20:37:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936311647] [2023-11-28 20:37:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936311647] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:37:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250474144] [2023-11-28 20:37:53,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:53,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:37:53,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:37:53,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:37:54,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:37:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:54,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:37:54,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:37:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-11-28 20:37:54,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:37:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-28 20:37:54,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250474144] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:37:54,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:37:54,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-28 20:37:54,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766040039] [2023-11-28 20:37:54,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:37:54,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:37:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:54,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:37:54,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:37:54,352 INFO L87 Difference]: Start difference. First operand 314 states and 424 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2023-11-28 20:37:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:54,753 INFO L93 Difference]: Finished difference Result 514 states and 675 transitions. [2023-11-28 20:37:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:37:54,754 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 110 [2023-11-28 20:37:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:54,757 INFO L225 Difference]: With dead ends: 514 [2023-11-28 20:37:54,757 INFO L226 Difference]: Without dead ends: 354 [2023-11-28 20:37:54,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:37:54,759 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 126 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:54,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 201 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:37:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-11-28 20:37:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 326. [2023-11-28 20:37:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 228 states have (on average 1.1710526315789473) internal successors, (267), 228 states have internal predecessors, (267), 80 states have call successors, (80), 17 states have call predecessors, (80), 17 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-28 20:37:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 427 transitions. [2023-11-28 20:37:54,825 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 427 transitions. Word has length 110 [2023-11-28 20:37:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:54,826 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 427 transitions. [2023-11-28 20:37:54,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2023-11-28 20:37:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 427 transitions. [2023-11-28 20:37:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-28 20:37:54,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:54,827 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:37:54,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:37:55,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:37:55,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:55,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash -508214185, now seen corresponding path program 1 times [2023-11-28 20:37:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222730539] [2023-11-28 20:37:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:37:55,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:37:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:37:55,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:37:55,137 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:37:55,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:37:55,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:37:55,143 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:37:55,147 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:37:55,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:37:55,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:37:55,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-28 20:37:55,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:37:55,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-28 20:37:55,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated [2023-11-28 20:37:55,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:37:55,203 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-28 20:37:55,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-28 20:37:55,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-28 20:37:55,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-28 20:37:55,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-28 20:37:55,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:37:55,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-28 20:37:55,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-28 20:37:55,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-28 20:37:55,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-28 20:37:55,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:37:55,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-28 20:37:55,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-28 20:37:55,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-28 20:37:55,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:37:55,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-28 20:37:55,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:37:55 BoogieIcfgContainer [2023-11-28 20:37:55,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:37:55,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:37:55,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:37:55,224 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:37:55,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:37:41" (3/4) ... [2023-11-28 20:37:55,226 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:37:55,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:37:55,228 INFO L158 Benchmark]: Toolchain (without parser) took 14526.66ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 115.7MB in the beginning and 282.0MB in the end (delta: -166.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2023-11-28 20:37:55,228 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:37:55,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.69ms. Allocated memory is still 159.4MB. Free memory was 115.6MB in the beginning and 103.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:37:55,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 100.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:37:55,229 INFO L158 Benchmark]: Boogie Preprocessor took 50.29ms. Allocated memory is still 159.4MB. Free memory was 100.1MB in the beginning and 96.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:37:55,229 INFO L158 Benchmark]: RCFGBuilder took 461.68ms. Allocated memory is still 159.4MB. Free memory was 96.9MB in the beginning and 119.9MB in the end (delta: -23.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-11-28 20:37:55,230 INFO L158 Benchmark]: TraceAbstraction took 13684.44ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 119.1MB in the beginning and 282.0MB in the end (delta: -162.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2023-11-28 20:37:55,230 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 352.3MB. Free memory is still 282.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:37:55,232 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.20ms. Allocated memory is still 98.6MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.69ms. Allocated memory is still 159.4MB. Free memory was 115.6MB in the beginning and 103.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 100.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.29ms. Allocated memory is still 159.4MB. Free memory was 100.1MB in the beginning and 96.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 461.68ms. Allocated memory is still 159.4MB. Free memory was 96.9MB in the beginning and 119.9MB in the end (delta: -23.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13684.44ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 119.1MB in the beginning and 282.0MB in the end (delta: -162.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 352.3MB. Free memory is still 282.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 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 shiftRight at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_7 = 256; [L26] signed long int var_1_8 = 63; [L27] signed long int var_1_9 = 1; [L28] signed long int var_1_10 = 0; [L29] signed long int var_1_11 = 16; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] signed long int var_1_15 = 4; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_12 = var_1_12 [L98] last_1_var_1_17 = var_1_17 [L108] RET 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, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L86] var_1_11 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L92] var_1_18 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L43] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = last_1_var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L54] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L62] COND TRUE (~ var_1_17) <= stepLocal_3 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L63] COND FALSE !((var_1_14 - 64) < stepLocal_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101-L102] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((signed long int) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 989 mSDsluCounter, 2171 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1360 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1354 IncrementalHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 811 mSDtfsCounter, 1354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 908 GetRequests, 805 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=11, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 414 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1493 NumberOfCodeBlocks, 1493 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1587 ConstructedInterpolants, 0 QuantifiedInterpolants, 7409 SizeOfPredicates, 22 NumberOfNonLiveVariables, 535 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 7104/7200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:37:55,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:37:57,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:37:57,214 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:37:57,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:37:57,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:37:57,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:37:57,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:37:57,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:37:57,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:37:57,258 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:37:57,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:37:57,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:37:57,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:37:57,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:37:57,261 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:37:57,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:37:57,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:37:57,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:37:57,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:37:57,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:37:57,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:37:57,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:37:57,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:37:57,266 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:37:57,266 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:37:57,267 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:37:57,267 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:37:57,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:37:57,268 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:37:57,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:37:57,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:37:57,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:37:57,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:37:57,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:37:57,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:37:57,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:37:57,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:37:57,271 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:37:57,272 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:37:57,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:37:57,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:37:57,272 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:37:57,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:37:57,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:37:57,273 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:37:57,273 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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2023-11-28 20:37:57,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:37:57,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:37:57,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:37:57,579 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:37:57,579 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:37:57,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-28 20:38:00,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:38:00,616 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:38:00,617 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-28 20:38:00,627 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/data/6a0529d65/b7c7127be5cc42b6a33eac0747a8c8a5/FLAGd4b06e7ad [2023-11-28 20:38:00,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/data/6a0529d65/b7c7127be5cc42b6a33eac0747a8c8a5 [2023-11-28 20:38:00,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:38:00,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:38:00,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:38:00,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:38:00,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:38:00,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:00,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41038ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00, skipping insertion in model container [2023-11-28 20:38:00,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:00,682 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:38:00,840 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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2023-11-28 20:38:00,879 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:38:00,897 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:38:00,910 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_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2023-11-28 20:38:00,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:38:00,950 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:38:00,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00 WrapperNode [2023-11-28 20:38:00,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:38:00,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:38:00,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:38:00,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:38:00,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:00,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:00,998 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-11-28 20:38:00,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:38:00,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:38:01,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:38:01,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:38:01,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,038 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-28 20:38:01,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:38:01,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:38:01,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:38:01,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:38:01,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (1/1) ... [2023-11-28 20:38:01,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:38:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:38:01,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:38:01,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:38:01,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:38:01,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:38:01,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:38:01,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:38:01,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:38:01,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:38:01,221 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:38:01,224 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:38:01,436 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:38:01,491 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:38:01,491 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:38:01,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:01 BoogieIcfgContainer [2023-11-28 20:38:01,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:38:01,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:38:01,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:38:01,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:38:01,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:38:00" (1/3) ... [2023-11-28 20:38:01,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5101349f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:38:01, skipping insertion in model container [2023-11-28 20:38:01,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:00" (2/3) ... [2023-11-28 20:38:01,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5101349f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:38:01, skipping insertion in model container [2023-11-28 20:38:01,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:01" (3/3) ... [2023-11-28 20:38:01,502 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-28 20:38:01,529 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:38:01,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:38:01,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:38:01,585 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;@5c802549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:38:01,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:38:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 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-28 20:38:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-28 20:38:01,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:38:01,604 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] [2023-11-28 20:38:01,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:38:01,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1570447154, now seen corresponding path program 1 times [2023-11-28 20:38:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:38:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220549625] [2023-11-28 20:38:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:01,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:38:01,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:38:01,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:38:01,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 20:38:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:01,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:38:01,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:38:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-11-28 20:38:01,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:38:01,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:38:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220549625] [2023-11-28 20:38:01,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220549625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:01,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:01,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:38:01,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935098218] [2023-11-28 20:38:01,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:01,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:38:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:38:01,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:38:01,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:38:01,881 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 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) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-28 20:38:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:38:01,923 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2023-11-28 20:38:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:38:01,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2023-11-28 20:38:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:38:01,934 INFO L225 Difference]: With dead ends: 85 [2023-11-28 20:38:01,935 INFO L226 Difference]: Without dead ends: 42 [2023-11-28 20:38:01,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:38:01,942 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:38:01,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:38:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-28 20:38:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-28 20:38:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-28 20:38:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2023-11-28 20:38:01,986 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 63 transitions. Word has length 97 [2023-11-28 20:38:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:38:01,987 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 63 transitions. [2023-11-28 20:38:01,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-28 20:38:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 63 transitions. [2023-11-28 20:38:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-28 20:38:01,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:38:01,993 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] [2023-11-28 20:38:02,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:38:02,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:38:02,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:38:02,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash -169214158, now seen corresponding path program 1 times [2023-11-28 20:38:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:38:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845228688] [2023-11-28 20:38:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:02,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:38:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:38:02,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:38:02,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 20:38:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:02,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:38:02,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:38:02,350 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-28 20:38:02,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:38:02,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:38:02,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845228688] [2023-11-28 20:38:02,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845228688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:02,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:38:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319634752] [2023-11-28 20:38:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:02,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:38:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:38:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:38:02,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:02,355 INFO L87 Difference]: Start difference. First operand 42 states and 63 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-28 20:38:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:38:02,402 INFO L93 Difference]: Finished difference Result 93 states and 138 transitions. [2023-11-28 20:38:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:38:02,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 97 [2023-11-28 20:38:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:38:02,406 INFO L225 Difference]: With dead ends: 93 [2023-11-28 20:38:02,407 INFO L226 Difference]: Without dead ends: 52 [2023-11-28 20:38:02,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:38:02,409 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:38:02,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:38:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-28 20:38:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2023-11-28 20:38:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-28 20:38:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2023-11-28 20:38:02,421 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 97 [2023-11-28 20:38:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:38:02,423 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2023-11-28 20:38:02,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-28 20:38:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2023-11-28 20:38:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-28 20:38:02,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:38:02,426 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] [2023-11-28 20:38:02,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:38:02,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:38:02,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:38:02,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash -111955856, now seen corresponding path program 1 times [2023-11-28 20:38:02,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:38:02,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711824989] [2023-11-28 20:38:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:02,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:38:02,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:38:02,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:38:02,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19ecc86a-6295-4a15-a3b7-4f1deb9ef293/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 20:38:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:02,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-28 20:38:02,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:38:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-11-28 20:38:49,073 INFO L327 TraceCheckSpWp]: Computing backward predicates...