./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:40:38,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:40:38,237 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:40:38,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:40:38,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:40:38,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:40:38,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:40:38,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:40:38,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:40:38,282 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:40:38,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:40:38,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:40:38,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:40:38,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:40:38,287 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:40:38,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:40:38,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:40:38,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:40:38,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:40:38,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:40:38,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:40:38,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:40:38,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:40:38,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:40:38,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:40:38,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:40:38,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:40:38,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:40:38,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:40:38,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:40:38,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:40:38,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:40:38,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:40:38,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:40:38,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:40:38,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:40:38,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:40:38,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:40:38,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:40:38,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:40:38,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:40:38,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:40:38,305 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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 -> 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 [2024-11-08 18:40:38,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:40:38,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:40:38,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:40:38,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:40:38,648 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:40:38,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i Unable to find full path for "g++" [2024-11-08 18:40:40,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:40:40,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:40:40,895 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2024-11-08 18:40:40,911 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/data/10cf96019/85f31d6534f349148b767de8b53baa9f/FLAG98ecfa6a3 [2024-11-08 18:40:41,230 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/data/10cf96019/85f31d6534f349148b767de8b53baa9f [2024-11-08 18:40:41,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:40:41,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:40:41,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:40:41,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:40:41,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:40:41,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21417dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41, skipping insertion in model container [2024-11-08 18:40:41,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:40:41,457 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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i[916,929] [2024-11-08 18:40:41,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:40:41,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:40:41,522 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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i[916,929] [2024-11-08 18:40:41,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:40:41,563 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:40:41,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41 WrapperNode [2024-11-08 18:40:41,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:40:41,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:40:41,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:40:41,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:40:41,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,629 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-08 18:40:41,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:40:41,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:40:41,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:40:41,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:40:41,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,660 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 18:40:41,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:40:41,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:40:41,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:40:41,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:40:41,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (1/1) ... [2024-11-08 18:40:41,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:40:41,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:40:41,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:40:41,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:40:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:40:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:40:41,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:40:41,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:40:41,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:40:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:40:41,879 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:40:41,883 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:40:42,347 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 18:40:42,350 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:40:42,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:40:42,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:40:42,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:40:42 BoogieIcfgContainer [2024-11-08 18:40:42,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:40:42,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:40:42,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:40:42,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:40:42,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:40:41" (1/3) ... [2024-11-08 18:40:42,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370ad97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:40:42, skipping insertion in model container [2024-11-08 18:40:42,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:40:41" (2/3) ... [2024-11-08 18:40:42,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370ad97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:40:42, skipping insertion in model container [2024-11-08 18:40:42,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:40:42" (3/3) ... [2024-11-08 18:40:42,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-18.i [2024-11-08 18:40:42,403 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:40:42,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:40:42,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:40:42,493 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;@6eb0e46c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:40:42,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:40:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:40:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:40:42,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:42,515 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:40:42,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:40:42,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1750017002, now seen corresponding path program 1 times [2024-11-08 18:40:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:40:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835520608] [2024-11-08 18:40:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:42,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:40:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:40:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:40:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:40:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:40:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:40:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:40:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:40:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:40:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:40:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:40:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:40:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:40:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:40:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:40:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:40:43,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:40:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835520608] [2024-11-08 18:40:43,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835520608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:40:43,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:40:43,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:40:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670174835] [2024-11-08 18:40:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:40:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:40:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:40:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:40:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:40:43,048 INFO L87 Difference]: Start difference. First operand has 66 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:40:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:40:43,090 INFO L93 Difference]: Finished difference Result 125 states and 206 transitions. [2024-11-08 18:40:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:40:43,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-11-08 18:40:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:40:43,102 INFO L225 Difference]: With dead ends: 125 [2024-11-08 18:40:43,103 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 18:40:43,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 18:40:43,111 INFO L432 NwaCegarLoop]: 92 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, 92 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 18:40:43,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:40:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 18:40:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 18:40:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:40:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-11-08 18:40:43,178 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 97 [2024-11-08 18:40:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:40:43,178 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-11-08 18:40:43,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:40:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-11-08 18:40:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 18:40:43,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:43,186 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:40:43,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:40:43,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:40:43,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1879414102, now seen corresponding path program 1 times [2024-11-08 18:40:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:40:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937429085] [2024-11-08 18:40:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:40:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:40:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:40:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:40:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:40:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:40:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:40:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:40:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:40:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:40:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:40:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:40:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:40:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:40:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:40:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:40:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:40:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937429085] [2024-11-08 18:40:43,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937429085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:40:43,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:40:43,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:40:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817810594] [2024-11-08 18:40:43,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:40:43,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:40:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:40:43,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:40:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:40:43,919 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:40:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:40:44,139 INFO L93 Difference]: Finished difference Result 180 states and 270 transitions. [2024-11-08 18:40:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:40:44,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-08 18:40:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:40:44,142 INFO L225 Difference]: With dead ends: 180 [2024-11-08 18:40:44,143 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 18:40:44,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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 18:40:44,145 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 56 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:40:44,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 141 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:40:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 18:40:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-11-08 18:40:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 18:40:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-11-08 18:40:44,170 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 97 [2024-11-08 18:40:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:40:44,171 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-11-08 18:40:44,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:40:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-11-08 18:40:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 18:40:44,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:44,174 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:40:44,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:40:44,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:40:44,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash -252961870, now seen corresponding path program 1 times [2024-11-08 18:40:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:40:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698350035] [2024-11-08 18:40:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:40:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:40:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:40:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:40:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:40:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:40:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:40:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:40:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:40:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:40:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:40:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:40:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:40:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:40:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:40:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-08 18:40:44,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:40:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698350035] [2024-11-08 18:40:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698350035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:40:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734282988] [2024-11-08 18:40:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:44,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:44,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:40:44,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:40:44,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:40:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:45,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 18:40:45,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:40:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 18:40:45,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:40:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-08 18:40:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734282988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:40:46,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:40:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-11-08 18:40:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804936390] [2024-11-08 18:40:46,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:40:46,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:40:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:40:46,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:40:46,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:40:46,177 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-08 18:40:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:40:47,561 INFO L93 Difference]: Finished difference Result 378 states and 545 transitions. [2024-11-08 18:40:47,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:40:47,561 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) Word has length 98 [2024-11-08 18:40:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:40:47,564 INFO L225 Difference]: With dead ends: 378 [2024-11-08 18:40:47,565 INFO L226 Difference]: Without dead ends: 263 [2024-11-08 18:40:47,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 18:40:47,570 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 343 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:40:47,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 449 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:40:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-08 18:40:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2024-11-08 18:40:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 188 states have internal predecessors, (230), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:40:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 342 transitions. [2024-11-08 18:40:47,615 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 342 transitions. Word has length 98 [2024-11-08 18:40:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:40:47,616 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 342 transitions. [2024-11-08 18:40:47,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-08 18:40:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 342 transitions. [2024-11-08 18:40:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:40:47,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:47,618 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:40:47,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:40:47,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:40:47,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:40:47,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash 889211211, now seen corresponding path program 1 times [2024-11-08 18:40:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:40:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644346582] [2024-11-08 18:40:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:47,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:40:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:40:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:40:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:40:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:40:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:40:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:40:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:40:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:40:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:40:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:40:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:40:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:40:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:40:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:40:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:40:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:40:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:40:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644346582] [2024-11-08 18:40:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644346582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:40:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:40:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:40:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581775927] [2024-11-08 18:40:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:40:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:40:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:40:54,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:40:54,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:40:54,241 INFO L87 Difference]: Start difference. First operand 253 states and 342 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:40:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:40:58,620 INFO L93 Difference]: Finished difference Result 669 states and 886 transitions. [2024-11-08 18:40:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:40:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-08 18:40:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:40:58,624 INFO L225 Difference]: With dead ends: 669 [2024-11-08 18:40:58,627 INFO L226 Difference]: Without dead ends: 419 [2024-11-08 18:40:58,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2024-11-08 18:40:58,634 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 330 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:40:58,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 616 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 18:40:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-08 18:40:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 266. [2024-11-08 18:40:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 201 states have (on average 1.228855721393035) internal successors, (247), 201 states have internal predecessors, (247), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:40:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 359 transitions. [2024-11-08 18:40:58,678 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 359 transitions. Word has length 99 [2024-11-08 18:40:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:40:58,678 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 359 transitions. [2024-11-08 18:40:58,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:40:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 359 transitions. [2024-11-08 18:40:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:40:58,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:40:58,681 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:40:58,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:40:58,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:40:58,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:40:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash -131857143, now seen corresponding path program 1 times [2024-11-08 18:40:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:40:58,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103644938] [2024-11-08 18:40:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:40:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:40:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:41:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:41:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:41:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:41:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:41:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:41:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:41:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:41:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:41:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:41:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:41:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:41:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:41:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:41:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:41:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:02,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103644938] [2024-11-08 18:41:02,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103644938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:02,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:02,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:41:02,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057449827] [2024-11-08 18:41:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:02,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:41:02,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:02,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:41:02,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:41:02,894 INFO L87 Difference]: Start difference. First operand 266 states and 359 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:08,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-08 18:41:12,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-08 18:41:16,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-08 18:41:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:20,804 INFO L93 Difference]: Finished difference Result 557 states and 732 transitions. [2024-11-08 18:41:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:41:20,805 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-08 18:41:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:20,808 INFO L225 Difference]: With dead ends: 557 [2024-11-08 18:41:20,808 INFO L226 Difference]: Without dead ends: 429 [2024-11-08 18:41:20,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-11-08 18:41:20,810 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 312 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 47 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:20,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 655 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1183 Invalid, 3 Unknown, 0 Unchecked, 15.1s Time] [2024-11-08 18:41:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-08 18:41:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 266. [2024-11-08 18:41:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 201 states have (on average 1.2189054726368158) internal successors, (245), 201 states have internal predecessors, (245), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:41:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 357 transitions. [2024-11-08 18:41:20,851 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 357 transitions. Word has length 99 [2024-11-08 18:41:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:20,852 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 357 transitions. [2024-11-08 18:41:20,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 357 transitions. [2024-11-08 18:41:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 18:41:20,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:20,854 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:20,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:41:20,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 444466101, now seen corresponding path program 1 times [2024-11-08 18:41:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784874001] [2024-11-08 18:41:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:41:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:41:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:41:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:41:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:41:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:41:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:41:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:41:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:41:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:41:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:41:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:41:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:41:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:41:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:41:20,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:20,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784874001] [2024-11-08 18:41:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784874001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:20,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:41:20,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266395387] [2024-11-08 18:41:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:41:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:41:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:41:20,997 INFO L87 Difference]: Start difference. First operand 266 states and 357 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:21,036 INFO L93 Difference]: Finished difference Result 534 states and 721 transitions. [2024-11-08 18:41:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:41:21,037 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2024-11-08 18:41:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:21,039 INFO L225 Difference]: With dead ends: 534 [2024-11-08 18:41:21,039 INFO L226 Difference]: Without dead ends: 271 [2024-11-08 18:41:21,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 18:41:21,042 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:21,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:41:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-08 18:41:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2024-11-08 18:41:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 204 states have (on average 1.2156862745098038) internal successors, (248), 204 states have internal predecessors, (248), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:41:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 360 transitions. [2024-11-08 18:41:21,088 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 360 transitions. Word has length 100 [2024-11-08 18:41:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:21,089 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 360 transitions. [2024-11-08 18:41:21,089 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 360 transitions. [2024-11-08 18:41:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 18:41:21,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:21,091 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:21,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:41:21,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:21,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:21,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1000669754, now seen corresponding path program 1 times [2024-11-08 18:41:21,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:21,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800675515] [2024-11-08 18:41:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:21,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:41:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:41:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:41:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:41:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:41:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:41:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:41:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:41:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:41:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:41:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:41:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:41:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:41:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:41:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:41:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:21,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800675515] [2024-11-08 18:41:21,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800675515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:21,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:41:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791340399] [2024-11-08 18:41:21,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:41:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:21,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:41:21,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:41:21,710 INFO L87 Difference]: Start difference. First operand 269 states and 360 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:22,065 INFO L93 Difference]: Finished difference Result 331 states and 432 transitions. [2024-11-08 18:41:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:41:22,066 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2024-11-08 18:41:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:22,068 INFO L225 Difference]: With dead ends: 331 [2024-11-08 18:41:22,069 INFO L226 Difference]: Without dead ends: 329 [2024-11-08 18:41:22,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:41:22,071 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:22,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:41:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-08 18:41:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 315. [2024-11-08 18:41:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 250 states have (on average 1.208) internal successors, (302), 250 states have internal predecessors, (302), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:41:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 414 transitions. [2024-11-08 18:41:22,118 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 414 transitions. Word has length 101 [2024-11-08 18:41:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:22,119 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 414 transitions. [2024-11-08 18:41:22,119 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 414 transitions. [2024-11-08 18:41:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 18:41:22,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:22,120 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:22,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:41:22,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:22,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1213308760, now seen corresponding path program 1 times [2024-11-08 18:41:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:22,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460670695] [2024-11-08 18:41:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:41:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:41:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:41:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:41:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:41:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:41:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:41:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:41:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:41:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:41:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:41:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:41:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:41:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:41:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:41:22,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:22,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460670695] [2024-11-08 18:41:22,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460670695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:22,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:22,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:41:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361955749] [2024-11-08 18:41:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:22,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:41:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:41:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:41:22,216 INFO L87 Difference]: Start difference. First operand 315 states and 414 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:22,360 INFO L93 Difference]: Finished difference Result 535 states and 710 transitions. [2024-11-08 18:41:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:41:22,361 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2024-11-08 18:41:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:22,363 INFO L225 Difference]: With dead ends: 535 [2024-11-08 18:41:22,363 INFO L226 Difference]: Without dead ends: 367 [2024-11-08 18:41:22,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 18:41:22,365 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 71 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:22,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 125 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:41:22,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-08 18:41:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 275. [2024-11-08 18:41:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 210 states have (on average 1.1952380952380952) internal successors, (251), 210 states have internal predecessors, (251), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:41:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 363 transitions. [2024-11-08 18:41:22,398 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 363 transitions. Word has length 101 [2024-11-08 18:41:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:22,399 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 363 transitions. [2024-11-08 18:41:22,399 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 363 transitions. [2024-11-08 18:41:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 18:41:22,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:22,400 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:22,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:41:22,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:22,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash -611282606, now seen corresponding path program 1 times [2024-11-08 18:41:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:22,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164154124] [2024-11-08 18:41:22,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:41:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:41:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:41:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:41:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:41:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:41:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:41:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:41:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:41:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:41:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:41:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:41:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:41:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:41:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:41:22,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164154124] [2024-11-08 18:41:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164154124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:22,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:41:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100292956] [2024-11-08 18:41:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:41:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:41:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:41:22,488 INFO L87 Difference]: Start difference. First operand 275 states and 363 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:22,653 INFO L93 Difference]: Finished difference Result 420 states and 552 transitions. [2024-11-08 18:41:22,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:41:22,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 102 [2024-11-08 18:41:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:22,655 INFO L225 Difference]: With dead ends: 420 [2024-11-08 18:41:22,656 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 18:41:22,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 18:41:22,657 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:22,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:41:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 18:41:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2024-11-08 18:41:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 214 states have (on average 1.1775700934579438) internal successors, (252), 214 states have internal predecessors, (252), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:41:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 364 transitions. [2024-11-08 18:41:22,693 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 364 transitions. Word has length 102 [2024-11-08 18:41:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:22,693 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 364 transitions. [2024-11-08 18:41:22,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 364 transitions. [2024-11-08 18:41:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 18:41:22,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:22,695 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:22,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:41:22,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:22,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash -90566791, now seen corresponding path program 1 times [2024-11-08 18:41:22,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:22,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329527845] [2024-11-08 18:41:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:22,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:41:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:41:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:41:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:41:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:41:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:41:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:41:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:41:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:41:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:41:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:41:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:41:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:41:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:41:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:41:23,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329527845] [2024-11-08 18:41:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329527845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:23,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:41:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972813312] [2024-11-08 18:41:23,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:23,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:41:23,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:41:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:41:23,799 INFO L87 Difference]: Start difference. First operand 279 states and 364 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:24,611 INFO L93 Difference]: Finished difference Result 531 states and 680 transitions. [2024-11-08 18:41:24,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:41:24,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 103 [2024-11-08 18:41:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:24,614 INFO L225 Difference]: With dead ends: 531 [2024-11-08 18:41:24,614 INFO L226 Difference]: Without dead ends: 384 [2024-11-08 18:41:24,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:41:24,615 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 74 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:24,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 299 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:41:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-08 18:41:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 361. [2024-11-08 18:41:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 280 states have (on average 1.167857142857143) internal successors, (327), 280 states have internal predecessors, (327), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 18:41:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 467 transitions. [2024-11-08 18:41:24,657 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 467 transitions. Word has length 103 [2024-11-08 18:41:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:24,657 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 467 transitions. [2024-11-08 18:41:24,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 467 transitions. [2024-11-08 18:41:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 18:41:24,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:24,659 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:24,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:41:24,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1019306197, now seen corresponding path program 1 times [2024-11-08 18:41:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:24,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066388596] [2024-11-08 18:41:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:41:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:41:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:41:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:41:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:41:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:41:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:41:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:41:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:41:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:41:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:41:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:41:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:41:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:41:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:41:25,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:25,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066388596] [2024-11-08 18:41:25,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066388596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:25,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:25,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:41:25,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956324520] [2024-11-08 18:41:25,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:25,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:41:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:25,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:41:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:41:25,408 INFO L87 Difference]: Start difference. First operand 361 states and 467 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:26,067 INFO L93 Difference]: Finished difference Result 548 states and 697 transitions. [2024-11-08 18:41:26,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:41:26,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2024-11-08 18:41:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:26,071 INFO L225 Difference]: With dead ends: 548 [2024-11-08 18:41:26,071 INFO L226 Difference]: Without dead ends: 401 [2024-11-08 18:41:26,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:41:26,072 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 89 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:26,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 390 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:41:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-08 18:41:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 275. [2024-11-08 18:41:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 210 states have (on average 1.1571428571428573) internal successors, (243), 210 states have internal predecessors, (243), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:41:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 355 transitions. [2024-11-08 18:41:26,115 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 355 transitions. Word has length 104 [2024-11-08 18:41:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:26,116 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 355 transitions. [2024-11-08 18:41:26,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:41:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 355 transitions. [2024-11-08 18:41:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 18:41:26,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:26,117 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:26,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:41:26,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:26,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1818498602, now seen corresponding path program 1 times [2024-11-08 18:41:26,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:26,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505776582] [2024-11-08 18:41:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 18:41:26,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912589392] [2024-11-08 18:41:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:26,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:41:26,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:41:26,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:41:26,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:41:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:41:26,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:41:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:41:26,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:41:26,397 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:41:26,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:41:26,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:41:26,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:41:26,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:41:26,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:41:26,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:41:26 BoogieIcfgContainer [2024-11-08 18:41:26,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:41:26,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:41:26,699 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:41:26,699 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:41:26,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:40:42" (3/4) ... [2024-11-08 18:41:26,703 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:41:26,704 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:41:26,705 INFO L158 Benchmark]: Toolchain (without parser) took 45469.28ms. Allocated memory was 199.2MB in the beginning and 453.0MB in the end (delta: 253.8MB). Free memory was 165.8MB in the beginning and 223.4MB in the end (delta: -57.6MB). Peak memory consumption was 197.8MB. Max. memory is 16.1GB. [2024-11-08 18:41:26,705 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 104.9MB. Free memory was 73.5MB in the beginning and 73.5MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:41:26,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.90ms. Allocated memory is still 199.2MB. Free memory was 165.4MB in the beginning and 151.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 18:41:26,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.50ms. Allocated memory is still 199.2MB. Free memory was 151.2MB in the beginning and 147.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:41:26,706 INFO L158 Benchmark]: Boogie Preprocessor took 55.10ms. Allocated memory is still 199.2MB. Free memory was 147.8MB in the beginning and 144.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:41:26,706 INFO L158 Benchmark]: RCFGBuilder took 680.75ms. Allocated memory is still 199.2MB. Free memory was 144.4MB in the beginning and 121.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 18:41:26,707 INFO L158 Benchmark]: TraceAbstraction took 44323.31ms. Allocated memory was 199.2MB in the beginning and 453.0MB in the end (delta: 253.8MB). Free memory was 120.5MB in the beginning and 224.5MB in the end (delta: -103.9MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. [2024-11-08 18:41:26,707 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 453.0MB. Free memory was 224.5MB in the beginning and 223.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:41:26,709 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.24ms. Allocated memory is still 104.9MB. Free memory was 73.5MB in the beginning and 73.5MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.90ms. Allocated memory is still 199.2MB. Free memory was 165.4MB in the beginning and 151.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.50ms. Allocated memory is still 199.2MB. Free memory was 151.2MB in the beginning and 147.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.10ms. Allocated memory is still 199.2MB. Free memory was 147.8MB in the beginning and 144.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 680.75ms. Allocated memory is still 199.2MB. Free memory was 144.4MB in the beginning and 121.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 44323.31ms. Allocated memory was 199.2MB in the beginning and 453.0MB in the end (delta: 253.8MB). Free memory was 120.5MB in the beginning and 224.5MB in the end (delta: -103.9MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 453.0MB. Free memory was 224.5MB in the beginning and 223.4MB in the end (delta: 1.0MB). 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 to_int at line 91, overapproximation of bitwiseOr at line 91, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 99; [L23] signed short int var_1_7 = 18477; [L24] signed short int var_1_8 = 5; [L25] signed long int var_1_9 = 5; [L26] signed long int var_1_10 = 0; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 256; [L31] unsigned char var_1_15 = 0; [L32] unsigned char last_1_var_1_11 = 16; [L33] unsigned long int last_1_var_1_14 = 256; VAL [isInitial=0, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=18477, var_1_8=5, var_1_9=5] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L87] last_1_var_1_11 = var_1_11 [L88] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=18477, var_1_8=5, var_1_9=5] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L64] var_1_7 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L65] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L66] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L66] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L67] var_1_8 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L69] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L69] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L70] var_1_9 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L71] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L72] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L73] var_1_10 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L74] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L75] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L78] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L81] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L83] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L37] signed short int stepLocal_3 = var_1_8; [L38] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L39] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L46] EXPR var_1_11 & var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L46] COND FALSE !((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) [L51] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_11; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L54] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L54] unsigned long int stepLocal_0 = var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))); [L55] COND FALSE !(stepLocal_0 != var_1_11) [L60] var_1_1 = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_7=16383, var_1_8=256, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_7=16383, var_1_8=256, var_1_9=0] [L91] EXPR ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((signed long int) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] [L91-L92] return ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((signed long int) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1356 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1356 mSDsluCounter, 3433 SdHoareTripleChecker+Invalid, 19.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2433 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3936 IncrementalHoareTripleChecker+Invalid, 4126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1000 mSDtfsCounter, 3936 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 535 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=10, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 589 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1409 NumberOfCodeBlocks, 1409 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1284 ConstructedInterpolants, 0 QuantifiedInterpolants, 6878 SizeOfPredicates, 2 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 4615/4732 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 18:41:26,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:41:29,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:41:29,207 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:41:29,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:41:29,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:41:29,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:41:29,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:41:29,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:41:29,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:41:29,253 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:41:29,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:41:29,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:41:29,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:41:29,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:41:29,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:41:29,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:41:29,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:41:29,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:41:29,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:41:29,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:41:29,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:41:29,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:41:29,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:41:29,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:41:29,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:41:29,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:41:29,263 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:41:29,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:41:29,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:41:29,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:41:29,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:41:29,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:41:29,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:41:29,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:41:29,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:41:29,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:41:29,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:41:29,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:41:29,266 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:41:29,266 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:41:29,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:41:29,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:41:29,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:41:29,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:41:29,268 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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 -> 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 [2024-11-08 18:41:29,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:41:29,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:41:29,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:41:29,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:41:29,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:41:29,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i Unable to find full path for "g++" [2024-11-08 18:41:31,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:41:32,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:41:32,188 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2024-11-08 18:41:32,197 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/data/302e00acb/c196b1bd31d34d31b727ae6f3e50b12d/FLAG472d017f9 [2024-11-08 18:41:32,212 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/data/302e00acb/c196b1bd31d34d31b727ae6f3e50b12d [2024-11-08 18:41:32,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:41:32,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:41:32,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:41:32,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:41:32,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:41:32,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf1b3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32, skipping insertion in model container [2024-11-08 18:41:32,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:41:32,447 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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i[916,929] [2024-11-08 18:41:32,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:41:32,542 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:41:32,560 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_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i[916,929] [2024-11-08 18:41:32,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:41:32,636 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:41:32,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32 WrapperNode [2024-11-08 18:41:32,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:41:32,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:41:32,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:41:32,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:41:32,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,702 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-08 18:41:32,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:41:32,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:41:32,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:41:32,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:41:32,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,769 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 18:41:32,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:41:32,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:41:32,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:41:32,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:41:32,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (1/1) ... [2024-11-08 18:41:32,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:41:32,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:41:32,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:41:32,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:41:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:41:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:41:32,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:41:32,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:41:32,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:41:32,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:41:33,044 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:41:33,050 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:41:33,376 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 18:41:33,377 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:41:33,398 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:41:33,398 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:41:33,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:41:33 BoogieIcfgContainer [2024-11-08 18:41:33,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:41:33,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:41:33,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:41:33,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:41:33,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:41:32" (1/3) ... [2024-11-08 18:41:33,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41951178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:41:33, skipping insertion in model container [2024-11-08 18:41:33,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:32" (2/3) ... [2024-11-08 18:41:33,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41951178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:41:33, skipping insertion in model container [2024-11-08 18:41:33,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:41:33" (3/3) ... [2024-11-08 18:41:33,411 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-18.i [2024-11-08 18:41:33,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:41:33,430 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:41:33,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:41:33,509 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;@1d91cf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:41:33,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:41:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:41:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 18:41:33,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:33,533 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:33,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:33,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash 915818127, now seen corresponding path program 1 times [2024-11-08 18:41:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:41:33,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803469710] [2024-11-08 18:41:33,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:33,554 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 18:41:33,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:41:33,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:33,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:33,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:41:33,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:41:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-08 18:41:33,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:41:33,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:41:33,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803469710] [2024-11-08 18:41:33,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803469710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:33,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:33,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:41:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540121924] [2024-11-08 18:41:33,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:33,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:41:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:41:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:41:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:41:33,883 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:41:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:33,910 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2024-11-08 18:41:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:41:33,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-11-08 18:41:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:33,922 INFO L225 Difference]: With dead ends: 87 [2024-11-08 18:41:33,922 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 18:41:33,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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 18:41:33,929 INFO L432 NwaCegarLoop]: 62 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, 62 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 18:41:33,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:41:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 18:41:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 18:41:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:41:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2024-11-08 18:41:33,985 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 90 [2024-11-08 18:41:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:33,986 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2024-11-08 18:41:33,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:41:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2024-11-08 18:41:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 18:41:33,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:33,991 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:33,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:34,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:34,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:34,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash 915633487, now seen corresponding path program 1 times [2024-11-08 18:41:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:41:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449271279] [2024-11-08 18:41:34,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:34,195 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 18:41:34,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:41:34,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:34,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:34,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 18:41:34,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:41:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 18:41:35,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:41:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-08 18:41:35,895 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:41:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449271279] [2024-11-08 18:41:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449271279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:41:35,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:41:35,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-08 18:41:35,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120426063] [2024-11-08 18:41:35,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:41:35,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:41:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:41:35,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:41:35,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:41:35,901 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-08 18:41:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:37,790 INFO L93 Difference]: Finished difference Result 223 states and 314 transitions. [2024-11-08 18:41:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 18:41:37,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 90 [2024-11-08 18:41:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:37,797 INFO L225 Difference]: With dead ends: 223 [2024-11-08 18:41:37,798 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 18:41:37,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=494, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:41:37,802 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 132 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:37,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 248 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:41:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 18:41:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 92. [2024-11-08 18:41:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 18:41:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-11-08 18:41:37,845 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 90 [2024-11-08 18:41:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:37,846 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-11-08 18:41:37,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-08 18:41:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-08 18:41:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:41:37,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:37,852 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:37,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:38,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:38,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:38,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1913846234, now seen corresponding path program 1 times [2024-11-08 18:41:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:41:38,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603451458] [2024-11-08 18:41:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:38,055 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 18:41:38,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:41:38,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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 18:41:38,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5eb824-49ff-42b6-8ac7-7b3359f98fcd/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)] Waiting until timeout for monitored process [2024-11-08 18:41:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:38,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 18:41:38,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:52:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 90 proven. 93 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-08 18:52:11,472 INFO L311 TraceCheckSpWp]: Computing backward predicates...