./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX --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 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:43:12,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:43:12,796 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:43:12,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:43:12,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:43:12,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:43:12,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:43:12,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:43:12,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:43:12,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:43:12,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:43:12,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:43:12,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:43:12,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:43:12,865 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:43:12,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:43:12,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:43:12,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:43:12,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:43:12,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:43:12,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:43:12,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:43:12,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:43:12,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:43:12,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:43:12,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:43:12,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:43:12,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:43:12,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:43:12,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:43:12,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:43:12,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:43:12,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:43:12,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:43:12,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:43:12,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:43:12,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:43:12,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:43:12,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:43:12,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:43:12,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:43:12,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:43:12,903 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_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX 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 -> 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 [2024-11-08 17:43:13,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:43:13,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:43:13,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:43:13,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:43:13,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:43:13,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i Unable to find full path for "g++" [2024-11-08 17:43:15,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:43:15,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:43:15,968 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2024-11-08 17:43:15,981 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/data/dcc1c0ddc/87d5a1fa342a4517b3047a5c8870e0e8/FLAGddc04d0dd [2024-11-08 17:43:16,005 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/data/dcc1c0ddc/87d5a1fa342a4517b3047a5c8870e0e8 [2024-11-08 17:43:16,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:43:16,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:43:16,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:43:16,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:43:16,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:43:16,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584988e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16, skipping insertion in model container [2024-11-08 17:43:16,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:43:16,352 WARN L250 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_4ee448a1-badb-4e8a-8747-464bee9d5904/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i[913,926] [2024-11-08 17:43:16,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:43:16,439 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:43:16,455 WARN L250 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_4ee448a1-badb-4e8a-8747-464bee9d5904/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i[913,926] [2024-11-08 17:43:16,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:43:16,519 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:43:16,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16 WrapperNode [2024-11-08 17:43:16,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:43:16,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:43:16,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:43:16,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:43:16,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,609 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-08 17:43:16,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:43:16,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:43:16,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:43:16,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:43:16,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,655 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]. [2024-11-08 17:43:16,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:43:16,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:43:16,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:43:16,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:43:16,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (1/1) ... [2024-11-08 17:43:16,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:43:16,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:16,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:43:16,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:43:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:43:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:43:16,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:43:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:43:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:43:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:43:16,875 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:43:16,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:43:17,384 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 17:43:17,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:43:17,401 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:43:17,401 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:43:17,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:43:17 BoogieIcfgContainer [2024-11-08 17:43:17,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:43:17,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:43:17,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:43:17,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:43:17,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:43:16" (1/3) ... [2024-11-08 17:43:17,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b40d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:43:17, skipping insertion in model container [2024-11-08 17:43:17,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:16" (2/3) ... [2024-11-08 17:43:17,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b40d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:43:17, skipping insertion in model container [2024-11-08 17:43:17,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:43:17" (3/3) ... [2024-11-08 17:43:17,414 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2024-11-08 17:43:17,436 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:43:17,437 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:43:17,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:43:17,518 INFO L333 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, 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;@773f0dc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:43:17,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:43:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:43:17,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:17,538 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:17,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:17,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:17,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1238316369, now seen corresponding path program 1 times [2024-11-08 17:43:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:17,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171557350] [2024-11-08 17:43:17,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:17,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:17,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171557350] [2024-11-08 17:43:18,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171557350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:18,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:18,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:43:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312266389] [2024-11-08 17:43:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:18,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:43:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:18,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:43:18,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:43:18,087 INFO L87 Difference]: Start difference. First operand has 66 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:43:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:18,117 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2024-11-08 17:43:18,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:43:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2024-11-08 17:43:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:18,129 INFO L225 Difference]: With dead ends: 125 [2024-11-08 17:43:18,130 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 17:43:18,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:43:18,139 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:18,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:43:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 17:43:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 17:43:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-11-08 17:43:18,195 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 74 [2024-11-08 17:43:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-11-08 17:43:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:43:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-11-08 17:43:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:43:18,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:18,201 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:18,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:43:18,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:18,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1649673461, now seen corresponding path program 1 times [2024-11-08 17:43:18,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:18,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534570542] [2024-11-08 17:43:18,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534570542] [2024-11-08 17:43:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534570542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:43:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755964870] [2024-11-08 17:43:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:18,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:43:18,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:18,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:43:18,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:18,675 INFO L87 Difference]: Start difference. First operand 62 states and 90 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:18,732 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2024-11-08 17:43:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:43:18,736 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-11-08 17:43:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:18,739 INFO L225 Difference]: With dead ends: 122 [2024-11-08 17:43:18,741 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 17:43:18,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:18,745 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:18,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:43:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 17:43:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-08 17:43:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-11-08 17:43:18,765 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 74 [2024-11-08 17:43:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:18,770 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-11-08 17:43:18,770 INFO L472 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-11-08 17:43:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:43:18,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:18,777 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:18,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:43:18,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:18,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:18,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1965235465, now seen corresponding path program 1 times [2024-11-08 17:43:18,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:18,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331463453] [2024-11-08 17:43:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:18,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:19,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331463453] [2024-11-08 17:43:19,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331463453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:19,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:19,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:43:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415764653] [2024-11-08 17:43:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:19,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:43:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:19,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:43:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:43:19,131 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:19,478 INFO L93 Difference]: Finished difference Result 148 states and 214 transitions. [2024-11-08 17:43:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:43:19,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-11-08 17:43:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:19,481 INFO L225 Difference]: With dead ends: 148 [2024-11-08 17:43:19,481 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 17:43:19,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:43:19,484 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:19,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:43:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 17:43:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2024-11-08 17:43:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-11-08 17:43:19,497 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 74 [2024-11-08 17:43:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:19,498 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-11-08 17:43:19,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-08 17:43:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:43:19,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:19,501 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:19,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:43:19,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1707070027, now seen corresponding path program 1 times [2024-11-08 17:43:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389223230] [2024-11-08 17:43:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389223230] [2024-11-08 17:43:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389223230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:23,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:43:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881254898] [2024-11-08 17:43:23,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:23,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:43:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:43:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:43:23,248 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:24,363 INFO L93 Difference]: Finished difference Result 268 states and 388 transitions. [2024-11-08 17:43:24,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:43:24,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-11-08 17:43:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:24,370 INFO L225 Difference]: With dead ends: 268 [2024-11-08 17:43:24,370 INFO L226 Difference]: Without dead ends: 206 [2024-11-08 17:43:24,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:43:24,372 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 363 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:24,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 280 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:43:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-08 17:43:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 89. [2024-11-08 17:43:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-08 17:43:24,400 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 74 [2024-11-08 17:43:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:24,401 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-08 17:43:24,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-08 17:43:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:43:24,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:24,406 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:24,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:43:24,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:24,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 593752563, now seen corresponding path program 1 times [2024-11-08 17:43:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:24,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737366213] [2024-11-08 17:43:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:24,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:25,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:25,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737366213] [2024-11-08 17:43:25,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737366213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:25,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:25,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:43:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522552650] [2024-11-08 17:43:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:43:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:43:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:43:25,228 INFO L87 Difference]: Start difference. First operand 89 states and 129 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:25,761 INFO L93 Difference]: Finished difference Result 207 states and 301 transitions. [2024-11-08 17:43:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:43:25,762 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-11-08 17:43:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:25,763 INFO L225 Difference]: With dead ends: 207 [2024-11-08 17:43:25,764 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 17:43:25,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:43:25,770 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:25,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 204 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:43:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 17:43:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2024-11-08 17:43:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2024-11-08 17:43:25,793 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 74 [2024-11-08 17:43:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:25,793 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2024-11-08 17:43:25,794 INFO L472 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2024-11-08 17:43:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 17:43:25,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:25,801 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:43:25,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:25,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash 960171229, now seen corresponding path program 1 times [2024-11-08 17:43:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145974984] [2024-11-08 17:43:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145974984] [2024-11-08 17:43:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145974984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:43:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091873878] [2024-11-08 17:43:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:25,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:43:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:43:25,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:25,947 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:26,029 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-11-08 17:43:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:43:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2024-11-08 17:43:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:26,034 INFO L225 Difference]: With dead ends: 196 [2024-11-08 17:43:26,034 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 17:43:26,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:26,039 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 54 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 183 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 [2024-11-08 17:43:26,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 183 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:43:26,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 17:43:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2024-11-08 17:43:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-08 17:43:26,064 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 75 [2024-11-08 17:43:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:26,064 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-08 17:43:26,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-08 17:43:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 17:43:26,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:26,070 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:26,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:43:26,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:26,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1268479734, now seen corresponding path program 1 times [2024-11-08 17:43:26,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451199517] [2024-11-08 17:43:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451199517] [2024-11-08 17:43:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451199517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:26,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:26,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:43:26,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343718471] [2024-11-08 17:43:26,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:26,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:43:26,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:26,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:43:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:26,200 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:26,271 INFO L93 Difference]: Finished difference Result 207 states and 295 transitions. [2024-11-08 17:43:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:43:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2024-11-08 17:43:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:26,274 INFO L225 Difference]: With dead ends: 207 [2024-11-08 17:43:26,275 INFO L226 Difference]: Without dead ends: 120 [2024-11-08 17:43:26,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:26,279 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:26,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 143 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:43:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-08 17:43:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2024-11-08 17:43:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-11-08 17:43:26,297 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 75 [2024-11-08 17:43:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:26,301 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-11-08 17:43:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-11-08 17:43:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 17:43:26,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:26,304 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:26,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:43:26,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:26,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:26,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1671568424, now seen corresponding path program 1 times [2024-11-08 17:43:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:26,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447045932] [2024-11-08 17:43:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:26,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:26,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447045932] [2024-11-08 17:43:26,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447045932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:26,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:26,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:43:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905114206] [2024-11-08 17:43:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:26,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:43:26,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:26,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:43:26,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:43:26,506 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:26,904 INFO L93 Difference]: Finished difference Result 241 states and 333 transitions. [2024-11-08 17:43:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:43:26,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-11-08 17:43:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:26,906 INFO L225 Difference]: With dead ends: 241 [2024-11-08 17:43:26,907 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 17:43:26,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:43:26,910 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 201 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:26,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 314 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:43:26,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 17:43:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2024-11-08 17:43:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 137 states have internal predecessors, (180), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:43:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2024-11-08 17:43:26,952 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 76 [2024-11-08 17:43:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:26,953 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2024-11-08 17:43:26,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2024-11-08 17:43:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 17:43:26,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:26,954 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:43:26,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:26,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1084762410, now seen corresponding path program 1 times [2024-11-08 17:43:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703741175] [2024-11-08 17:43:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:26,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:28,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703741175] [2024-11-08 17:43:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703741175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:28,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:28,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:43:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077800602] [2024-11-08 17:43:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:28,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:43:28,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:28,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:43:28,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:43:28,638 INFO L87 Difference]: Start difference. First operand 160 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:30,058 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2024-11-08 17:43:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:43:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-11-08 17:43:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:30,063 INFO L225 Difference]: With dead ends: 467 [2024-11-08 17:43:30,063 INFO L226 Difference]: Without dead ends: 314 [2024-11-08 17:43:30,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:43:30,067 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 265 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:30,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 331 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:43:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-08 17:43:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 180. [2024-11-08 17:43:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 157 states have internal predecessors, (209), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:43:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 249 transitions. [2024-11-08 17:43:30,096 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 249 transitions. Word has length 76 [2024-11-08 17:43:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:30,097 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 249 transitions. [2024-11-08 17:43:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 249 transitions. [2024-11-08 17:43:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 17:43:30,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:30,098 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:30,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:43:30,100 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:30,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash 267113960, now seen corresponding path program 1 times [2024-11-08 17:43:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:30,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347587670] [2024-11-08 17:43:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:30,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:30,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347587670] [2024-11-08 17:43:30,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347587670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:30,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:30,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:43:30,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972314050] [2024-11-08 17:43:30,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:30,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:43:30,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:30,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:43:30,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:30,307 INFO L87 Difference]: Start difference. First operand 180 states and 249 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:30,444 INFO L93 Difference]: Finished difference Result 504 states and 698 transitions. [2024-11-08 17:43:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:43:30,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-11-08 17:43:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:30,451 INFO L225 Difference]: With dead ends: 504 [2024-11-08 17:43:30,451 INFO L226 Difference]: Without dead ends: 331 [2024-11-08 17:43:30,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:43:30,453 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:30,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 174 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:43:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-08 17:43:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 260. [2024-11-08 17:43:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 224 states have (on average 1.3348214285714286) internal successors, (299), 226 states have internal predecessors, (299), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 17:43:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 357 transitions. [2024-11-08 17:43:30,483 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 357 transitions. Word has length 76 [2024-11-08 17:43:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:30,484 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 357 transitions. [2024-11-08 17:43:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 357 transitions. [2024-11-08 17:43:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 17:43:30,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:30,486 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:30,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:43:30,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:30,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -493352072, now seen corresponding path program 1 times [2024-11-08 17:43:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:30,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111403779] [2024-11-08 17:43:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:43:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:43:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:43:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:43:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:43:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:43:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:43:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:43:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:43:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 17:43:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:43:30,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111403779] [2024-11-08 17:43:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111403779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:43:30,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513561670] [2024-11-08 17:43:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:30,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:30,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:30,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:43:30,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:43:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:30,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:43:30,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 17:43:31,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:43:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 17:43:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513561670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:43:31,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:43:31,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-11-08 17:43:31,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440553942] [2024-11-08 17:43:31,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:43:31,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:43:31,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:43:31,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:43:31,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:43:31,514 INFO L87 Difference]: Start difference. First operand 260 states and 357 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-08 17:43:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:32,462 INFO L93 Difference]: Finished difference Result 872 states and 1163 transitions. [2024-11-08 17:43:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 17:43:32,463 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 77 [2024-11-08 17:43:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:32,468 INFO L225 Difference]: With dead ends: 872 [2024-11-08 17:43:32,468 INFO L226 Difference]: Without dead ends: 768 [2024-11-08 17:43:32,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 17:43:32,470 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1031 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:32,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 712 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:43:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-08 17:43:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 278. [2024-11-08 17:43:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 220 states have (on average 1.2636363636363637) internal successors, (278), 221 states have internal predecessors, (278), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-08 17:43:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 368 transitions. [2024-11-08 17:43:32,516 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 368 transitions. Word has length 77 [2024-11-08 17:43:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:32,516 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 368 transitions. [2024-11-08 17:43:32,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-08 17:43:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 368 transitions. [2024-11-08 17:43:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 17:43:32,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:32,518 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:32,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:43:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 17:43:32,719 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:32,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash -70650246, now seen corresponding path program 1 times [2024-11-08 17:43:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:43:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515396918] [2024-11-08 17:43:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:43:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:43:32,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:43:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:43:32,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:43:32,838 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:43:32,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:43:32,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:43:32,848 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:32,952 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:43:32,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:43:32 BoogieIcfgContainer [2024-11-08 17:43:32,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:43:32,957 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:43:32,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:43:32,957 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:43:32,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:43:17" (3/4) ... [2024-11-08 17:43:32,961 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:43:32,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:43:32,963 INFO L158 Benchmark]: Toolchain (without parser) took 16950.99ms. Allocated memory was 144.7MB in the beginning and 293.6MB in the end (delta: 148.9MB). Free memory was 103.7MB in the beginning and 153.7MB in the end (delta: -50.0MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2024-11-08 17:43:32,963 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 144.7MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:43:32,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.65ms. Allocated memory is still 144.7MB. Free memory was 103.1MB in the beginning and 89.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 17:43:32,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.77ms. Allocated memory is still 144.7MB. Free memory was 89.0MB in the beginning and 85.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:43:32,964 INFO L158 Benchmark]: Boogie Preprocessor took 69.10ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 82.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:43:32,965 INFO L158 Benchmark]: RCFGBuilder took 721.69ms. Allocated memory is still 144.7MB. Free memory was 82.2MB in the beginning and 61.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 17:43:32,966 INFO L158 Benchmark]: TraceAbstraction took 15551.00ms. Allocated memory was 144.7MB in the beginning and 293.6MB in the end (delta: 148.9MB). Free memory was 60.7MB in the beginning and 153.7MB in the end (delta: -93.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-08 17:43:32,966 INFO L158 Benchmark]: Witness Printer took 5.84ms. Allocated memory is still 293.6MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:43:32,968 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.38ms. Allocated memory is still 144.7MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.65ms. Allocated memory is still 144.7MB. Free memory was 103.1MB in the beginning and 89.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.77ms. Allocated memory is still 144.7MB. Free memory was 89.0MB in the beginning and 85.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.10ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 82.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 721.69ms. Allocated memory is still 144.7MB. Free memory was 82.2MB in the beginning and 61.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15551.00ms. Allocated memory was 144.7MB in the beginning and 293.6MB in the end (delta: 148.9MB). Free memory was 60.7MB in the beginning and 153.7MB in the end (delta: -93.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 5.84ms. Allocated memory is still 293.6MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; VAL [isInitial=0, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2283 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2275 mSDsluCounter, 2878 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1946 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1835 IncrementalHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 932 mSDtfsCounter, 1835 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 959 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 4575 SizeOfPredicates, 4 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1800/1872 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 [2024-11-08 17:43:33,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX --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 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:43:35,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:43:36,001 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:43:36,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:43:36,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:43:36,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:43:36,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:43:36,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:43:36,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:43:36,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:43:36,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:43:36,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:43:36,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:43:36,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:43:36,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:43:36,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:43:36,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:43:36,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:43:36,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:43:36,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:43:36,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:43:36,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:43:36,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:43:36,084 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:43:36,084 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:43:36,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:43:36,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:43:36,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:43:36,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:43:36,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:43:36,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:43:36,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:43:36,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:43:36,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:43:36,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:43:36,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:43:36,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:43:36,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:43:36,094 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:43:36,095 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:43:36,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:43:36,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:43:36,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:43:36,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:43:36,096 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_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX 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 -> 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 [2024-11-08 17:43:36,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:43:36,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:43:36,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:43:36,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:43:36,623 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:43:36,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i Unable to find full path for "g++" [2024-11-08 17:43:39,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:43:39,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:43:39,547 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2024-11-08 17:43:39,559 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/data/a687c6d60/6f2f25e7fb014ebf9df7250237016a12/FLAGa555de2c2 [2024-11-08 17:43:39,580 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/data/a687c6d60/6f2f25e7fb014ebf9df7250237016a12 [2024-11-08 17:43:39,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:43:39,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:43:39,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:43:39,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:43:39,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:43:39,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:43:39" (1/1) ... [2024-11-08 17:43:39,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cf5cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:39, skipping insertion in model container [2024-11-08 17:43:39,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:43:39" (1/1) ... [2024-11-08 17:43:39,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:43:39,862 WARN L250 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_4ee448a1-badb-4e8a-8747-464bee9d5904/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i[913,926] [2024-11-08 17:43:39,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:43:39,986 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:43:40,007 WARN L250 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_4ee448a1-badb-4e8a-8747-464bee9d5904/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i[913,926] [2024-11-08 17:43:40,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:43:40,115 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:43:40,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40 WrapperNode [2024-11-08 17:43:40,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:43:40,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:43:40,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:43:40,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:43:40,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,172 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-08 17:43:40,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:43:40,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:43:40,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:43:40,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:43:40,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,224 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]. [2024-11-08 17:43:40,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:43:40,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:43:40,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:43:40,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:43:40,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (1/1) ... [2024-11-08 17:43:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:43:40,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:40,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:43:40,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:43:40,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:43:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:43:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:43:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:43:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:43:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:43:40,514 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:43:40,517 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:43:41,469 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 17:43:41,470 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:43:41,485 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:43:41,486 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:43:41,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:43:41 BoogieIcfgContainer [2024-11-08 17:43:41,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:43:41,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:43:41,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:43:41,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:43:41,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:43:39" (1/3) ... [2024-11-08 17:43:41,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30129bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:43:41, skipping insertion in model container [2024-11-08 17:43:41,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:43:40" (2/3) ... [2024-11-08 17:43:41,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30129bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:43:41, skipping insertion in model container [2024-11-08 17:43:41,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:43:41" (3/3) ... [2024-11-08 17:43:41,499 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2024-11-08 17:43:41,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:43:41,523 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:43:41,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:43:41,612 INFO L333 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, 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;@7ff6c15e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:43:41,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:43:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 17:43:41,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:41,632 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:41,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1568072735, now seen corresponding path program 1 times [2024-11-08 17:43:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758024326] [2024-11-08 17:43:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:41,658 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 [2024-11-08 17:43:41,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:43:41,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:43:41,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:43:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:41,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:43:41,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 17:43:42,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:43:42,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758024326] [2024-11-08 17:43:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758024326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:42,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:42,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:43:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348030433] [2024-11-08 17:43:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:42,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:43:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:43:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:43:42,091 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:43:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:42,136 INFO L93 Difference]: Finished difference Result 75 states and 117 transitions. [2024-11-08 17:43:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:43:42,139 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-11-08 17:43:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:42,150 INFO L225 Difference]: With dead ends: 75 [2024-11-08 17:43:42,150 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 17:43:42,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:43:42,165 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:42,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:43:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 17:43:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-08 17:43:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:43:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-08 17:43:42,234 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-08 17:43:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:42,237 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-08 17:43:42,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:43:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-08 17:43:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 17:43:42,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:42,243 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:42,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 17:43:42,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:43:42,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:42,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1446787995, now seen corresponding path program 1 times [2024-11-08 17:43:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346328754] [2024-11-08 17:43:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:42,449 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 [2024-11-08 17:43:42,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:43:42,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:43:42,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:43:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:42,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:43:42,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 17:43:43,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:43:44,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346328754] [2024-11-08 17:43:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346328754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:43:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419655780] [2024-11-08 17:43:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:44,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:43:44,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:43:44,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:43:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:44,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:43:44,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 17:43:44,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:43:45,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419655780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:43:45,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:43:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-08 17:43:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3938896] [2024-11-08 17:43:45,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:43:45,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:43:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:43:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:43:45,065 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:43:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:46,651 INFO L93 Difference]: Finished difference Result 112 states and 150 transitions. [2024-11-08 17:43:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:43:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-11-08 17:43:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:46,664 INFO L225 Difference]: With dead ends: 112 [2024-11-08 17:43:46,664 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 17:43:46,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:43:46,669 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 53 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:46,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 173 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 17:43:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 17:43:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2024-11-08 17:43:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:43:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2024-11-08 17:43:46,712 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 66 [2024-11-08 17:43:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:46,713 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2024-11-08 17:43:46,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:43:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2024-11-08 17:43:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 17:43:46,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:46,716 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:46,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:43:46,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:43:47,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:43:47,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:47,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:47,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1839815005, now seen corresponding path program 1 times [2024-11-08 17:43:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067449647] [2024-11-08 17:43:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:47,123 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 [2024-11-08 17:43:47,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:43:47,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:43:47,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 17:43:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:47,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:43:47,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:43:47,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:43:47,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067449647] [2024-11-08 17:43:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067449647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:47,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:47,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:43:47,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471076952] [2024-11-08 17:43:47,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:47,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:43:47,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:47,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:43:47,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:43:47,521 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:47,982 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2024-11-08 17:43:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:43:47,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2024-11-08 17:43:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:47,986 INFO L225 Difference]: With dead ends: 100 [2024-11-08 17:43:47,987 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 17:43:47,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:43:47,989 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:47,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 208 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:43:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 17:43:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-11-08 17:43:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:43:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-08 17:43:48,014 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 66 [2024-11-08 17:43:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:48,015 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-08 17:43:48,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:43:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-08 17:43:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 17:43:48,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:48,017 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:43:48,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 17:43:48,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:43:48,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:48,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1780709661, now seen corresponding path program 1 times [2024-11-08 17:43:48,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:48,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505764429] [2024-11-08 17:43:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:48,223 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 [2024-11-08 17:43:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:43:48,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:43:48,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ee448a1-badb-4e8a-8747-464bee9d5904/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 17:43:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:48,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 17:43:48,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:45:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 17:45:10,861 INFO L311 TraceCheckSpWp]: Computing backward predicates...