./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 70562da18636cefe71b678cd2257e55ff14c212499b21f4a61292b200a6210e2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:29:27,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:27,647 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:29:27,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:27,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:27,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:27,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:27,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:27,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:27,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:27,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:27,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:27,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:27,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:27,687 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:27,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:27,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:29:27,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:29:27,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:29:27,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:29:27,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:27,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:29:27,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:27,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:29:27,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:27,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:29:27,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:29:27,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:27,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:27,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:27,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:27,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:27,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:27,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:27,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:27,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:29:27,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:29:27,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:29:27,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:27,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:27,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:27,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:27,714 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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 -> 70562da18636cefe71b678cd2257e55ff14c212499b21f4a61292b200a6210e2 [2024-11-08 17:29:28,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:28,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:28,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:28,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:28,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:28,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i Unable to find full path for "g++" [2024-11-08 17:29:30,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:30,944 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:30,945 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i [2024-11-08 17:29:30,957 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/data/90ba5bd7c/22e4b446533947e49ec2b37b804edcc3/FLAG5a4c57c56 [2024-11-08 17:29:31,284 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/data/90ba5bd7c/22e4b446533947e49ec2b37b804edcc3 [2024-11-08 17:29:31,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:31,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:31,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:31,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:31,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:31,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:31,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2032ad32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31, skipping insertion in model container [2024-11-08 17:29:31,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:31,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:31,596 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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i[916,929] [2024-11-08 17:29:31,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:31,696 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:31,713 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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i[916,929] [2024-11-08 17:29:31,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:31,821 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:31,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31 WrapperNode [2024-11-08 17:29:31,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:31,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:31,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:31,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:31,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:31,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:31,960 INFO L138 Inliner]: procedures = 29, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 557 [2024-11-08 17:29:31,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:31,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:31,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:31,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:31,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:31,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:31,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:32,046 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 6, 71, 48, 11, 14]. 47 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 7, 5, 1, 1]. The 19 writes are split as follows [0, 1, 8, 8, 1, 1]. [2024-11-08 17:29:32,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:32,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:32,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:32,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:32,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:32,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:32,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:32,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:32,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:32,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:32,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (1/1) ... [2024-11-08 17:29:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:32,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:29:32,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:29:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:29:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:29:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:29:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:29:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 17:29:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 17:29:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:29:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:29:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:29:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:29:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 17:29:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 17:29:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:29:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:29:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:29:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:29:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 17:29:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 17:29:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:29:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:29:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:29:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:29:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 17:29:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 17:29:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:29:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:29:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:29:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:29:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 17:29:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 17:29:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:29:32,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:29:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:29:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:29:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:29:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:29:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 17:29:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 17:29:32,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:32,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:32,505 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:32,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:33,281 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:33,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:33,301 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:33,301 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:33,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:33 BoogieIcfgContainer [2024-11-08 17:29:33,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:33,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:33,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:33,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:33,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:31" (1/3) ... [2024-11-08 17:29:33,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34055ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:33, skipping insertion in model container [2024-11-08 17:29:33,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:31" (2/3) ... [2024-11-08 17:29:33,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34055ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:33, skipping insertion in model container [2024-11-08 17:29:33,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:33" (3/3) ... [2024-11-08 17:29:33,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-99.i [2024-11-08 17:29:33,337 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:33,337 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:33,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:33,442 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;@175993ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:33,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:33,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:33,469 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:33,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:33,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1284721653, now seen corresponding path program 1 times [2024-11-08 17:29:33,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953529177] [2024-11-08 17:29:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:33,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:29:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:29:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:29:34,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953529177] [2024-11-08 17:29:34,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953529177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:34,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:34,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:29:34,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364808408] [2024-11-08 17:29:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:34,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:29:34,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:29:34,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:34,043 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:34,081 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2024-11-08 17:29:34,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:29:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-11-08 17:29:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:34,092 INFO L225 Difference]: With dead ends: 243 [2024-11-08 17:29:34,093 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 17:29:34,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:34,100 INFO L432 NwaCegarLoop]: 177 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, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:34,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 17:29:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-08 17:29:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-11-08 17:29:34,153 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 156 [2024-11-08 17:29:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:34,154 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-11-08 17:29:34,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-11-08 17:29:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:34,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:34,159 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:34,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:29:34,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:34,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash -847738011, now seen corresponding path program 1 times [2024-11-08 17:29:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:34,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153698449] [2024-11-08 17:29:34,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:29:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:29:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:29:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153698449] [2024-11-08 17:29:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153698449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:34,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:34,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925351239] [2024-11-08 17:29:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:34,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:34,675 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:34,760 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2024-11-08 17:29:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-11-08 17:29:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:34,763 INFO L225 Difference]: With dead ends: 241 [2024-11-08 17:29:34,763 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 17:29:34,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:34,768 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:34,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 17:29:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-08 17:29:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-08 17:29:34,795 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 156 [2024-11-08 17:29:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:34,797 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-08 17:29:34,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-08 17:29:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:34,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:34,805 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:34,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:29:34,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:34,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1319094361, now seen corresponding path program 1 times [2024-11-08 17:29:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:34,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477625116] [2024-11-08 17:29:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:29:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:29:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:29:35,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477625116] [2024-11-08 17:29:35,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477625116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:35,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23505585] [2024-11-08 17:29:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:35,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:35,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:35,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:35,722 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:36,076 INFO L93 Difference]: Finished difference Result 350 states and 511 transitions. [2024-11-08 17:29:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:36,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-11-08 17:29:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:36,083 INFO L225 Difference]: With dead ends: 350 [2024-11-08 17:29:36,086 INFO L226 Difference]: Without dead ends: 230 [2024-11-08 17:29:36,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:36,088 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 152 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:36,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1141 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-08 17:29:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2024-11-08 17:29:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 189 states have internal predecessors, (260), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:29:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 332 transitions. [2024-11-08 17:29:36,120 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 332 transitions. Word has length 156 [2024-11-08 17:29:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:36,120 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 332 transitions. [2024-11-08 17:29:36,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 332 transitions. [2024-11-08 17:29:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:36,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:36,126 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:36,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:29:36,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1591436462, now seen corresponding path program 1 times [2024-11-08 17:29:36,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276737074] [2024-11-08 17:29:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:29:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:29:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:29:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:29:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276737074] [2024-11-08 17:29:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276737074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:36,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464576371] [2024-11-08 17:29:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:36,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:36,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:36,500 INFO L87 Difference]: Start difference. First operand 227 states and 332 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:29:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:36,548 INFO L93 Difference]: Finished difference Result 457 states and 669 transitions. [2024-11-08 17:29:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:36,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-08 17:29:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:36,556 INFO L225 Difference]: With dead ends: 457 [2024-11-08 17:29:36,558 INFO L226 Difference]: Without dead ends: 233 [2024-11-08 17:29:36,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:36,560 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:36,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-08 17:29:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-08 17:29:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.3711340206185567) internal successors, (266), 195 states have internal predecessors, (266), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:29:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 338 transitions. [2024-11-08 17:29:36,601 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 338 transitions. Word has length 156 [2024-11-08 17:29:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:36,602 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 338 transitions. [2024-11-08 17:29:36,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:29:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 338 transitions. [2024-11-08 17:29:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:29:36,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:36,607 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:29:36,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:36,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash 784072496, now seen corresponding path program 1 times [2024-11-08 17:29:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:36,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396770891] [2024-11-08 17:29:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:29:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896444926] [2024-11-08 17:29:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:36,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:36,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:36,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:29:36,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:29:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:29:37,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:29:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:29:37,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:29:37,830 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:29:37,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:29:37,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:29:38,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:38,037 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 17:29:38,208 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:29:38,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:29:38 BoogieIcfgContainer [2024-11-08 17:29:38,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:29:38,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:29:38,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:29:38,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:29:38,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:33" (3/4) ... [2024-11-08 17:29:38,218 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:29:38,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:29:38,221 INFO L158 Benchmark]: Toolchain (without parser) took 6930.55ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 95.6MB in the beginning and 79.3MB in the end (delta: 16.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-08 17:29:38,221 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 98.6MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:29:38,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.28ms. Allocated memory is still 130.0MB. Free memory was 95.2MB in the beginning and 78.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:29:38,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.83ms. Allocated memory is still 130.0MB. Free memory was 78.3MB in the beginning and 74.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:29:38,223 INFO L158 Benchmark]: Boogie Preprocessor took 157.08ms. Allocated memory is still 130.0MB. Free memory was 74.1MB in the beginning and 68.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:29:38,223 INFO L158 Benchmark]: RCFGBuilder took 1180.87ms. Allocated memory is still 130.0MB. Free memory was 68.9MB in the beginning and 65.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-08 17:29:38,224 INFO L158 Benchmark]: TraceAbstraction took 4909.11ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 64.6MB in the beginning and 80.4MB in the end (delta: -15.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-08 17:29:38,224 INFO L158 Benchmark]: Witness Printer took 5.33ms. Allocated memory is still 163.6MB. Free memory was 80.4MB in the beginning and 79.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:29:38,227 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.35ms. Allocated memory is still 98.6MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.28ms. Allocated memory is still 130.0MB. Free memory was 95.2MB in the beginning and 78.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.83ms. Allocated memory is still 130.0MB. Free memory was 78.3MB in the beginning and 74.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 157.08ms. Allocated memory is still 130.0MB. Free memory was 74.1MB in the beginning and 68.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1180.87ms. Allocated memory is still 130.0MB. Free memory was 68.9MB in the beginning and 65.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4909.11ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 64.6MB in the beginning and 80.4MB in the end (delta: -15.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Witness Printer took 5.33ms. Allocated memory is still 163.6MB. Free memory was 80.4MB in the beginning and 79.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L25-L27] float float_Array_0[7] = { 4.8, 127.25, 0.4, 99999999999.5, 500.5, 1000000000000000.6, 255.5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { 256, 25, 0, -50, -5 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 2 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 16 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 16 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] float_Array_0[0] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[0] [L69] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L69] EXPR float_Array_0[0] [L69] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] float_Array_0[1] = __VERIFIER_nondet_float() [L71] EXPR float_Array_0[1] [L71] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F [L71] EXPR float_Array_0[1] [L71] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] float_Array_0[2] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[2] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L73] EXPR float_Array_0[2] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] float_Array_0[3] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[3] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F [L75] EXPR float_Array_0[3] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] float_Array_0[4] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[4] [L77] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F [L77] EXPR float_Array_0[4] [L77] EXPR float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[4] >= 0.0F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854765600e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] float_Array_0[5] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[5] [L79] EXPR float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F [L79] EXPR float_Array_0[5] [L79] EXPR float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F) || (float_Array_0[5] <= 9223372.036854765600e+12F && float_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F) || (float_Array_0[5] <= 9223372.036854765600e+12F && float_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F) || (float_Array_0[5] <= 9223372.036854765600e+12F && float_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[5] >= 0.0F && float_Array_0[5] <= -1.0e-20F) || (float_Array_0[5] <= 9223372.036854765600e+12F && float_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] signed_long_int_Array_0[3] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L90] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L108] RET updateVariables() [L109] CALL step() [L40] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); [L41] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L41] COND TRUE (((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > stepLocal_0 [L42] EXPR float_Array_0[5] [L42] EXPR float_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L42] EXPR ((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]) [L42] EXPR float_Array_0[5] [L42] EXPR ((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L42] EXPR float_Array_0[3] [L42] float_Array_0[6] = (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]) [L48] EXPR float_Array_0[4] [L48] EXPR float_Array_0[3] [L48] EXPR float_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L48] COND FALSE !((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) [L51] EXPR signed_long_int_Array_0[1] [L51] signed_long_int_Array_0[2] = signed_long_int_Array_0[1] [L53] EXPR signed_long_int_Array_0[0] [L53] EXPR signed_short_int_Array_0[0] [L53] signed long int stepLocal_1 = signed_long_int_Array_0[0] % signed_short_int_Array_0[0]; [L54] EXPR float_Array_0[0] [L54] EXPR float_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L54] COND TRUE float_Array_0[0] == float_Array_0[5] [L55] EXPR signed_long_int_Array_0[1] [L55] signed_long_int_Array_0[4] = signed_long_int_Array_0[1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR ((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1) [L100] EXPR float_Array_0[6] [L100] EXPR float_Array_0[5] [L100] EXPR float_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR ((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]) [L100] EXPR float_Array_0[5] [L100] EXPR ((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR float_Array_0[3] [L100] EXPR ((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR (((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR (((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR ((((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1])))) && ((float_Array_0[0] == float_Array_0[5]) ? (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[1])) : (((signed_long_int_Array_0[0] % signed_short_int_Array_0[0]) != signed_long_int_Array_0[1]) ? (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) > (signed_long_int_Array_0[1])) ? (((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) : (signed_long_int_Array_0[1]))))) : (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100] EXPR ((((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1])))) && ((float_Array_0[0] == float_Array_0[5]) ? (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[1])) : (((signed_long_int_Array_0[0] % signed_short_int_Array_0[0]) != signed_long_int_Array_0[1]) ? (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) > (signed_long_int_Array_0[1])) ? (((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) : (signed_long_int_Array_0[1]))))) : (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L100-L101] return ((((((((200) < (128)) ? (200) : (128))) - unsigned_char_Array_0[0]) > ((((8) < 0 ) ? -(8) : (8)))) ? (float_Array_0[6] == ((float) (((((float_Array_0[5]) < (float_Array_0[4])) ? (float_Array_0[5]) : (float_Array_0[4]))) - float_Array_0[3]))) : (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[6] == ((float) (((((float_Array_0[1]) < (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))) + float_Array_0[2]))) : 1)) && (((float_Array_0[4] + float_Array_0[3]) == float_Array_0[6]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0])) ? (unsigned_char_Array_0[0]) : (signed_long_int_Array_0[0]))) - signed_long_int_Array_0[1]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_long_int_Array_0[1])))) && ((float_Array_0[0] == float_Array_0[5]) ? (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[1])) : (((signed_long_int_Array_0[0] % signed_short_int_Array_0[0]) != signed_long_int_Array_0[1]) ? (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) > (signed_long_int_Array_0[1])) ? (((signed_short_int_Array_0[0] + unsigned_char_Array_0[0]) + signed_long_int_Array_0[3])) : (signed_long_int_Array_0[1]))))) : (signed_long_int_Array_0[4] == ((signed long int) signed_long_int_Array_0[3])))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 2513 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1719 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 794 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2736/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 17:29:38,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 70562da18636cefe71b678cd2257e55ff14c212499b21f4a61292b200a6210e2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:29:41,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:41,121 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:29:41,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:41,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:41,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:41,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:41,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:41,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:41,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:41,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:41,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:41,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:41,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:41,185 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:41,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:41,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:29:41,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:29:41,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:29:41,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:41,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:29:41,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:41,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:29:41,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:29:41,193 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:29:41,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:41,194 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:29:41,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:29:41,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:29:41,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:41,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:41,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:41,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:41,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:41,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:41,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:41,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:41,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:29:41,202 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:29:41,202 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:29:41,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:41,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:41,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:41,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:41,218 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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 -> 70562da18636cefe71b678cd2257e55ff14c212499b21f4a61292b200a6210e2 [2024-11-08 17:29:41,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:41,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:41,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:41,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:41,724 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:41,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i Unable to find full path for "g++" [2024-11-08 17:29:43,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:44,184 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:44,185 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i [2024-11-08 17:29:44,195 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/data/dd841649e/88bcf72fd64f48d5b6ababef811190f6/FLAG95fcbaf6c [2024-11-08 17:29:44,214 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/data/dd841649e/88bcf72fd64f48d5b6ababef811190f6 [2024-11-08 17:29:44,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:44,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:44,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:44,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:44,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:44,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dcfecda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44, skipping insertion in model container [2024-11-08 17:29:44,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:44,485 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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i[916,929] [2024-11-08 17:29:44,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:44,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:44,623 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_a0411a0f-1f5c-423b-bb2c-cd620166e24b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-99.i[916,929] [2024-11-08 17:29:44,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:44,778 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:44,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44 WrapperNode [2024-11-08 17:29:44,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:44,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:44,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:44,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:44,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,915 INFO L138 Inliner]: procedures = 36, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 553 [2024-11-08 17:29:44,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:44,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:44,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:44,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:44,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,979 INFO L175 MemorySlicer]: Split 152 memory accesses to 6 slices as follows [2, 6, 71, 48, 11, 14]. 47 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 7, 5, 1, 1]. The 19 writes are split as follows [0, 1, 8, 8, 1, 1]. [2024-11-08 17:29:44,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:44,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:45,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:45,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:45,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:45,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:45,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:45,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:45,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:45,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:45,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (1/1) ... [2024-11-08 17:29:45,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:45,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:29:45,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:29:45,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:45,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:29:45,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:29:45,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:29:45,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 17:29:45,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 17:29:45,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 17:29:45,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 17:29:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 17:29:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 17:29:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 17:29:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 17:29:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 17:29:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:29:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:29:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:29:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:29:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 17:29:45,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 17:29:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 17:29:45,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 17:29:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 17:29:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 17:29:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 17:29:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 17:29:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:29:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:29:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 17:29:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 17:29:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 17:29:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-08 17:29:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:29:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:29:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:29:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 17:29:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 17:29:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 17:29:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:29:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:29:45,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 17:29:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 17:29:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 17:29:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 17:29:45,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:29:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:29:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 17:29:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 17:29:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 17:29:45,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-08 17:29:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 17:29:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 17:29:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 17:29:45,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 17:29:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 17:29:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-08 17:29:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:29:45,166 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:29:45,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:45,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:29:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:29:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 17:29:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 17:29:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 17:29:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 17:29:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:29:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:29:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 17:29:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 17:29:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 17:29:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 17:29:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:29:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:29:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:29:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 17:29:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 17:29:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 17:29:45,456 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:45,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:47,200 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:47,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:47,227 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:47,228 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:47,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:47 BoogieIcfgContainer [2024-11-08 17:29:47,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:47,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:47,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:47,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:47,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:44" (1/3) ... [2024-11-08 17:29:47,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac980e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:47, skipping insertion in model container [2024-11-08 17:29:47,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:44" (2/3) ... [2024-11-08 17:29:47,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac980e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:47, skipping insertion in model container [2024-11-08 17:29:47,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:47" (3/3) ... [2024-11-08 17:29:47,242 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-99.i [2024-11-08 17:29:47,264 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:47,264 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:47,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:47,366 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;@1b8fe9d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:47,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:47,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:47,390 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:47,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:47,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1284721653, now seen corresponding path program 1 times [2024-11-08 17:29:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523619535] [2024-11-08 17:29:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:47,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:47,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:47,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:29:47,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 17:29:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:29:48,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-08 17:29:48,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:48,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523619535] [2024-11-08 17:29:48,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523619535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:48,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:48,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:29:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280606100] [2024-11-08 17:29:48,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:48,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:29:48,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:29:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:48,155 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:48,194 INFO L93 Difference]: Finished difference Result 243 states and 381 transitions. [2024-11-08 17:29:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:29:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-11-08 17:29:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:48,211 INFO L225 Difference]: With dead ends: 243 [2024-11-08 17:29:48,211 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 17:29:48,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:48,219 INFO L432 NwaCegarLoop]: 177 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, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:48,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 17:29:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-08 17:29:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-11-08 17:29:48,280 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 156 [2024-11-08 17:29:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:48,281 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-11-08 17:29:48,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-11-08 17:29:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:48,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:48,287 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:48,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 17:29:48,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:48,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:48,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash -847738011, now seen corresponding path program 1 times [2024-11-08 17:29:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:48,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563725170] [2024-11-08 17:29:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:48,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:29:48,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 17:29:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:29:49,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-08 17:29:49,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:49,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563725170] [2024-11-08 17:29:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563725170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544895973] [2024-11-08 17:29:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:49,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:49,264 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:49,361 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2024-11-08 17:29:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-11-08 17:29:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:49,364 INFO L225 Difference]: With dead ends: 241 [2024-11-08 17:29:49,365 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 17:29:49,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:49,367 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:49,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 17:29:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-08 17:29:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-08 17:29:49,386 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 156 [2024-11-08 17:29:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:49,388 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-08 17:29:49,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-08 17:29:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:49,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:49,393 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:49,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:49,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:49,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:49,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:49,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1319094361, now seen corresponding path program 1 times [2024-11-08 17:29:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:49,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791313750] [2024-11-08 17:29:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:49,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:29:49,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 17:29:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:50,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:29:50,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:50,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-08 17:29:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-08 17:29:50,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:50,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:50,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791313750] [2024-11-08 17:29:50,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791313750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:50,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:50,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858712864] [2024-11-08 17:29:50,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:50,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:50,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:50,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:50,645 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:52,109 INFO L93 Difference]: Finished difference Result 243 states and 355 transitions. [2024-11-08 17:29:52,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:29:52,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-11-08 17:29:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:52,112 INFO L225 Difference]: With dead ends: 243 [2024-11-08 17:29:52,112 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 17:29:52,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:29:52,115 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 145 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:52,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 512 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 17:29:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 17:29:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-11-08 17:29:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2024-11-08 17:29:52,130 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 156 [2024-11-08 17:29:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:52,130 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2024-11-08 17:29:52,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2024-11-08 17:29:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:52,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:52,134 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:52,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:52,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:52,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:52,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1526742591, now seen corresponding path program 1 times [2024-11-08 17:29:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:52,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782438925] [2024-11-08 17:29:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:52,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:52,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:52,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:29:52,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 17:29:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:52,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:29:52,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:53,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2024-11-08 17:29:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 20 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-08 17:29:53,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:53,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-08 17:29:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 17:29:53,714 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782438925] [2024-11-08 17:29:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782438925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:29:53,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:29:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-08 17:29:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712340463] [2024-11-08 17:29:53,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:29:53,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:29:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:53,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:29:53,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:29:53,719 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-08 17:29:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:55,844 INFO L93 Difference]: Finished difference Result 252 states and 364 transitions. [2024-11-08 17:29:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:29:55,845 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 158 [2024-11-08 17:29:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:55,848 INFO L225 Difference]: With dead ends: 252 [2024-11-08 17:29:55,848 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 17:29:55,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:29:55,850 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 146 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:55,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 645 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:29:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 17:29:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-11-08 17:29:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.36) internal successors, (136), 100 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-08 17:29:55,867 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 158 [2024-11-08 17:29:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:55,868 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-08 17:29:55,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-08 17:29:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-08 17:29:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:55,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:55,873 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:55,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:56,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:56,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:56,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -475143679, now seen corresponding path program 1 times [2024-11-08 17:29:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:56,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760850453] [2024-11-08 17:29:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:56,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:56,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:56,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:29:56,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 17:29:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:56,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:29:56,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:56,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-08 17:29:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-08 17:29:56,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:56,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760850453] [2024-11-08 17:29:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760850453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:56,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:56,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198916689] [2024-11-08 17:29:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:56,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:56,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:56,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:56,991 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:58,167 INFO L93 Difference]: Finished difference Result 240 states and 346 transitions. [2024-11-08 17:29:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:29:58,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2024-11-08 17:29:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:58,172 INFO L225 Difference]: With dead ends: 240 [2024-11-08 17:29:58,173 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 17:29:58,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:29:58,174 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 133 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:58,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 500 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:29:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 17:29:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-08 17:29:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:29:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2024-11-08 17:29:58,234 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 158 [2024-11-08 17:29:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:58,234 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2024-11-08 17:29:58,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:29:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2024-11-08 17:29:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:29:58,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:58,238 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:58,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:58,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:58,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:58,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash 524021223, now seen corresponding path program 1 times [2024-11-08 17:29:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:58,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427684581] [2024-11-08 17:29:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:29:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:58,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:29:58,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (7)] Waiting until timeout for monitored process [2024-11-08 17:29:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:58,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:29:58,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:59,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-08 17:29:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-08 17:29:59,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:59,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427684581] [2024-11-08 17:29:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427684581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:59,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:59,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:59,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844073152] [2024-11-08 17:29:59,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:59,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:59,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:59,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:59,255 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:30:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:00,517 INFO L93 Difference]: Finished difference Result 240 states and 344 transitions. [2024-11-08 17:30:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:30:00,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2024-11-08 17:30:00,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:00,520 INFO L225 Difference]: With dead ends: 240 [2024-11-08 17:30:00,520 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 17:30:00,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:30:00,522 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 125 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:00,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 495 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:30:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 17:30:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-08 17:30:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:30:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 172 transitions. [2024-11-08 17:30:00,545 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 172 transitions. Word has length 160 [2024-11-08 17:30:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 172 transitions. [2024-11-08 17:30:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:30:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 172 transitions. [2024-11-08 17:30:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 17:30:00,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:00,556 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:00,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (7)] Forceful destruction successful, exit code 0 [2024-11-08 17:30:00,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:00,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:00,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash -635412927, now seen corresponding path program 1 times [2024-11-08 17:30:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:00,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39620593] [2024-11-08 17:30:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:00,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:00,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:00,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:30:00,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (8)] Waiting until timeout for monitored process [2024-11-08 17:30:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:01,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:30:01,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:01,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-08 17:30:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 17:30:01,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:30:01,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:01,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39620593] [2024-11-08 17:30:01,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39620593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:01,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:01,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:30:01,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393149106] [2024-11-08 17:30:01,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:01,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:30:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:01,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:30:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:30:01,672 INFO L87 Difference]: Start difference. First operand 121 states and 172 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:30:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:03,731 INFO L93 Difference]: Finished difference Result 354 states and 499 transitions. [2024-11-08 17:30:03,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:30:03,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2024-11-08 17:30:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:03,737 INFO L225 Difference]: With dead ends: 354 [2024-11-08 17:30:03,738 INFO L226 Difference]: Without dead ends: 236 [2024-11-08 17:30:03,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:30:03,741 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 325 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:03,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1256 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:30:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-08 17:30:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 136. [2024-11-08 17:30:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 114 states have internal predecessors, (153), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:30:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2024-11-08 17:30:03,796 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 191 transitions. Word has length 162 [2024-11-08 17:30:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:03,796 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 191 transitions. [2024-11-08 17:30:03,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:30:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2024-11-08 17:30:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 17:30:03,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:03,800 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:03,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (8)] Forceful destruction successful, exit code 0 [2024-11-08 17:30:04,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:04,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:04,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2019849400, now seen corresponding path program 1 times [2024-11-08 17:30:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:04,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002045810] [2024-11-08 17:30:04,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:04,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:04,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:04,005 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:30:04,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (9)] Waiting until timeout for monitored process [2024-11-08 17:30:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:04,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:30:04,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:30:04,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:30:04,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002045810] [2024-11-08 17:30:04,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002045810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:04,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:04,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:30:04,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267204572] [2024-11-08 17:30:04,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:04,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:30:04,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:30:04,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:04,664 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:30:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:04,849 INFO L93 Difference]: Finished difference Result 272 states and 383 transitions. [2024-11-08 17:30:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:30:04,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2024-11-08 17:30:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:04,851 INFO L225 Difference]: With dead ends: 272 [2024-11-08 17:30:04,851 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 17:30:04,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:04,853 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:04,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 661 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:30:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 17:30:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-08 17:30:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:30:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2024-11-08 17:30:04,867 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 162 [2024-11-08 17:30:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:04,867 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2024-11-08 17:30:04,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:30:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2024-11-08 17:30:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:30:04,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:04,869 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:04,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (9)] Forceful destruction successful, exit code 0 [2024-11-08 17:30:05,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:05,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:05,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash 503360470, now seen corresponding path program 1 times [2024-11-08 17:30:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863232594] [2024-11-08 17:30:05,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:05,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:05,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:05,072 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:30:05,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (10)] Waiting until timeout for monitored process [2024-11-08 17:30:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:05,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 17:30:05,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:05,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 17:30:06,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-08 17:30:06,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-08 17:30:06,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-08 17:30:06,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-08 17:30:07,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-08 17:30:09,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:30:09,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 52 [2024-11-08 17:30:09,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:30:09,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 54 [2024-11-08 17:30:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 369 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:30:09,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:10,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863232594] [2024-11-08 17:30:10,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863232594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:10,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856971488] [2024-11-08 17:30:10,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:10,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:30:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:30:10,353 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:30:10,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 17:30:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:10,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:30:10,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:11,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-08 17:30:11,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-08 17:30:11,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-08 17:30:11,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-08 17:30:11,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-08 17:30:13,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:30:13,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 40 [2024-11-08 17:30:13,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:30:13,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 42 [2024-11-08 17:30:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 147 proven. 273 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:30:14,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856971488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:14,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:30:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2024-11-08 17:30:14,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976125145] [2024-11-08 17:30:14,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:30:14,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:30:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:14,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:30:14,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2024-11-08 17:30:14,531 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 24 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 22 states have internal predecessors, (148), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) [2024-11-08 17:30:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:22,825 INFO L93 Difference]: Finished difference Result 513 states and 713 transitions. [2024-11-08 17:30:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 17:30:22,826 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 22 states have internal predecessors, (148), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) Word has length 163 [2024-11-08 17:30:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:22,829 INFO L225 Difference]: With dead ends: 513 [2024-11-08 17:30:22,829 INFO L226 Difference]: Without dead ends: 377 [2024-11-08 17:30:22,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 17:30:22,832 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 555 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:22,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1369 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-08 17:30:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-08 17:30:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 363. [2024-11-08 17:30:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 304 states have (on average 1.3289473684210527) internal successors, (404), 306 states have internal predecessors, (404), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 17:30:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 508 transitions. [2024-11-08 17:30:22,871 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 508 transitions. Word has length 163 [2024-11-08 17:30:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:22,872 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 508 transitions. [2024-11-08 17:30:22,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 22 states have internal predecessors, (148), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 6 states have call predecessors, (38), 8 states have call successors, (38) [2024-11-08 17:30:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 508 transitions. [2024-11-08 17:30:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:30:22,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:22,875 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:22,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 17:30:23,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:30:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:23,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:23,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1115614444, now seen corresponding path program 1 times [2024-11-08 17:30:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:23,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690349657] [2024-11-08 17:30:23,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:23,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:23,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:23,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:30:23,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (12)] Waiting until timeout for monitored process [2024-11-08 17:30:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:23,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:30:23,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-08 17:30:23,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:30:23,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:23,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690349657] [2024-11-08 17:30:23,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690349657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:23,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:23,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:30:23,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434375943] [2024-11-08 17:30:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:23,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:30:23,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:23,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:30:23,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:30:23,841 INFO L87 Difference]: Start difference. First operand 363 states and 508 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:30:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:24,102 INFO L93 Difference]: Finished difference Result 645 states and 898 transitions. [2024-11-08 17:30:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:30:24,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2024-11-08 17:30:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:24,107 INFO L225 Difference]: With dead ends: 645 [2024-11-08 17:30:24,108 INFO L226 Difference]: Without dead ends: 281 [2024-11-08 17:30:24,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:30:24,110 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:24,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 706 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:30:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-08 17:30:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 273. [2024-11-08 17:30:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 229 states have (on average 1.314410480349345) internal successors, (301), 230 states have internal predecessors, (301), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 17:30:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 377 transitions. [2024-11-08 17:30:24,136 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 377 transitions. Word has length 163 [2024-11-08 17:30:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:24,136 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 377 transitions. [2024-11-08 17:30:24,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:30:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 377 transitions. [2024-11-08 17:30:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:30:24,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:24,139 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:24,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (12)] Ended with exit code 0 [2024-11-08 17:30:24,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:24,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash -819818476, now seen corresponding path program 1 times [2024-11-08 17:30:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:24,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632352084] [2024-11-08 17:30:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:24,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:24,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:24,345 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:30:24,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (13)] Waiting until timeout for monitored process [2024-11-08 17:30:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:24,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:30:24,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-08 17:30:24,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:30:24,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:24,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632352084] [2024-11-08 17:30:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632352084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:24,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:24,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442947289] [2024-11-08 17:30:24,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:24,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:24,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:24,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:24,915 INFO L87 Difference]: Start difference. First operand 273 states and 377 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:30:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:24,980 INFO L93 Difference]: Finished difference Result 543 states and 751 transitions. [2024-11-08 17:30:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:24,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2024-11-08 17:30:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:24,983 INFO L225 Difference]: With dead ends: 543 [2024-11-08 17:30:24,983 INFO L226 Difference]: Without dead ends: 273 [2024-11-08 17:30:24,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:24,985 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:24,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:30:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-08 17:30:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-08 17:30:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 229 states have (on average 1.3100436681222707) internal successors, (300), 230 states have internal predecessors, (300), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 17:30:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 376 transitions. [2024-11-08 17:30:25,007 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 376 transitions. Word has length 163 [2024-11-08 17:30:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:25,008 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 376 transitions. [2024-11-08 17:30:25,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:30:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 376 transitions. [2024-11-08 17:30:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 17:30:25,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:25,010 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:25,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (13)] Ended with exit code 0 [2024-11-08 17:30:25,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:25,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:25,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 689163527, now seen corresponding path program 1 times [2024-11-08 17:30:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278666085] [2024-11-08 17:30:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:25,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:30:25,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:25,214 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:30:25,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/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 (14)] Waiting until timeout for monitored process [2024-11-08 17:30:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:47,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 17:30:47,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:47,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:30:48,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-08 17:30:48,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-08 17:30:53,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:30:53,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 105 [2024-11-08 17:31:06,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:31:06,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 388 treesize of output 136 [2024-11-08 17:31:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 355 proven. 69 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 17:31:07,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:31:35,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:31:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278666085] [2024-11-08 17:31:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278666085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:31:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850787997] [2024-11-08 17:31:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:35,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:31:35,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:31:35,008 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:31:35,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0411a0f-1f5c-423b-bb2c-cd620166e24b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process