./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU --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 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:00:39,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:00:39,163 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:00:39,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:00:39,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:00:39,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:00:39,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:00:39,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:00:39,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:00:39,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:00:39,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:00:39,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:00:39,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:00:39,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:00:39,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:00:39,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:00:39,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:00:39,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:00:39,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:00:39,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:00:39,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:00:39,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:00:39,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:00:39,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:00:39,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:00:39,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:00:39,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:00:39,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:00:39,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:00:39,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:00:39,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:00:39,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:00:39,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:39,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:00:39,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:00:39,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:00:39,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:00:39,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:00:39,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:00:39,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:00:39,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:00:39,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:00:39,244 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_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 [2024-10-31 22:00:39,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:00:39,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:00:39,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:00:39,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:00:39,600 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:00:39,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i Unable to find full path for "g++" [2024-10-31 22:00:41,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:00:41,905 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:00:41,905 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-10-31 22:00:41,920 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/data/77afd03db/29617af3802c4eeca1b4971cc1780059/FLAGa9fa3ff56 [2024-10-31 22:00:41,937 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/data/77afd03db/29617af3802c4eeca1b4971cc1780059 [2024-10-31 22:00:41,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:00:41,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:00:41,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:41,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:00:41,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:00:41,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:41" (1/1) ... [2024-10-31 22:00:41,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571c8602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:41, skipping insertion in model container [2024-10-31 22:00:41,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:41" (1/1) ... [2024-10-31 22:00:41,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:00:42,271 WARN L251 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_b7aa0856-88a8-40c8-9aa5-442014b3849d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i[916,929] [2024-10-31 22:00:42,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:42,406 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:00:42,423 WARN L251 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_b7aa0856-88a8-40c8-9aa5-442014b3849d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i[916,929] [2024-10-31 22:00:42,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:42,513 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:00:42,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42 WrapperNode [2024-10-31 22:00:42,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:42,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:42,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:00:42,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:00:42,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,620 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-10-31 22:00:42,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:42,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:00:42,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:00:42,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:00:42,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,713 INFO L175 MemorySlicer]: Split 110 memory accesses to 6 slices as follows [2, 16, 21, 39, 9, 23]. 35 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 3, 3, 1, 2]. The 15 writes are split as follows [0, 2, 4, 5, 2, 2]. [2024-10-31 22:00:42,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:00:42,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:00:42,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:00:42,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:00:42,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (1/1) ... [2024-10-31 22:00:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:42,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:00:42,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:00:42,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:00:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:00:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:00:42,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:00:42,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:00:42,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 22:00:42,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 22:00:42,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 22:00:42,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:00:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:00:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 22:00:42,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 22:00:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 22:00:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 22:00:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:00:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:00:42,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 22:00:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 22:00:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 22:00:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 22:00:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:00:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:00:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:00:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 22:00:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 22:00:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 22:00:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:00:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:00:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 22:00:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 22:00:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 22:00:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 22:00:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:00:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:00:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:00:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:00:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:00:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 22:00:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 22:00:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 22:00:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:00:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:00:43,086 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:00:43,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:00:43,655 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-10-31 22:00:43,655 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:00:43,676 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:00:43,676 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:00:43,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:43 BoogieIcfgContainer [2024-10-31 22:00:43,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:00:43,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:00:43,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:00:43,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:00:43,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:00:41" (1/3) ... [2024-10-31 22:00:43,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a145e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:43, skipping insertion in model container [2024-10-31 22:00:43,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:42" (2/3) ... [2024-10-31 22:00:43,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a145e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:43, skipping insertion in model container [2024-10-31 22:00:43,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:43" (3/3) ... [2024-10-31 22:00:43,727 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-78.i [2024-10-31 22:00:43,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:00:43,779 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:00:43,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:00:43,877 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;@37afab0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:00:43,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:00:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:00:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:43,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:43,901 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:43,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash -438494555, now seen corresponding path program 1 times [2024-10-31 22:00:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:43,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536888370] [2024-10-31 22:00:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:43,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:00:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:00:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:44,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536888370] [2024-10-31 22:00:44,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536888370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:44,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:44,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:00:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629451367] [2024-10-31 22:00:44,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:00:44,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:44,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:00:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:00:44,495 INFO L87 Difference]: Start difference. First operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:44,546 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-10-31 22:00:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:00:44,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-10-31 22:00:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:44,560 INFO L225 Difference]: With dead ends: 179 [2024-10-31 22:00:44,561 INFO L226 Difference]: Without dead ends: 89 [2024-10-31 22:00:44,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-10-31 22:00:44,569 INFO L432 NwaCegarLoop]: 129 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, 129 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-10-31 22:00:44,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-31 22:00:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-31 22:00:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:00:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-10-31 22:00:44,625 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2024-10-31 22:00:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:44,626 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-10-31 22:00:44,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-10-31 22:00:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:44,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:44,635 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:44,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:00:44,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:44,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1706018639, now seen corresponding path program 1 times [2024-10-31 22:00:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:44,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539492586] [2024-10-31 22:00:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:44,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:00:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:00:45,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539492586] [2024-10-31 22:00:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539492586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:45,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359869747] [2024-10-31 22:00:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:45,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:45,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:45,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:45,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:45,050 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:45,113 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-10-31 22:00:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-10-31 22:00:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:45,115 INFO L225 Difference]: With dead ends: 177 [2024-10-31 22:00:45,116 INFO L226 Difference]: Without dead ends: 91 [2024-10-31 22:00:45,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-10-31 22:00:45,118 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-10-31 22:00:45,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-31 22:00:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-31 22:00:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:00:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-10-31 22:00:45,130 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2024-10-31 22:00:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:45,132 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-10-31 22:00:45,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-10-31 22:00:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:45,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:45,138 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:45,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:00:45,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:45,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash 322567471, now seen corresponding path program 1 times [2024-10-31 22:00:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:45,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091234462] [2024-10-31 22:00:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:00:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:00:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:45,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091234462] [2024-10-31 22:00:45,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091234462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:45,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570745068] [2024-10-31 22:00:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:45,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:45,586 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:00:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:45,650 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-10-31 22:00:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:45,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-10-31 22:00:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:45,652 INFO L225 Difference]: With dead ends: 181 [2024-10-31 22:00:45,652 INFO L226 Difference]: Without dead ends: 93 [2024-10-31 22:00:45,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-10-31 22:00:45,654 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-10-31 22:00:45,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-31 22:00:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-31 22:00:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:00:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-10-31 22:00:45,671 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 98 [2024-10-31 22:00:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:45,672 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-10-31 22:00:45,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:00:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-10-31 22:00:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-31 22:00:45,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:45,676 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:45,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:00:45,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:45,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -561605494, now seen corresponding path program 1 times [2024-10-31 22:00:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472423989] [2024-10-31 22:00:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:00:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:00:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472423989] [2024-10-31 22:00:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472423989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:46,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603400008] [2024-10-31 22:00:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:46,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:46,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:46,083 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:00:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:46,186 INFO L93 Difference]: Finished difference Result 273 states and 393 transitions. [2024-10-31 22:00:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 100 [2024-10-31 22:00:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:46,190 INFO L225 Difference]: With dead ends: 273 [2024-10-31 22:00:46,190 INFO L226 Difference]: Without dead ends: 183 [2024-10-31 22:00:46,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:00:46,192 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 83 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:46,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:00:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-31 22:00:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-10-31 22:00:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.394904458598726) internal successors, (219), 157 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:00:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2024-10-31 22:00:46,228 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 100 [2024-10-31 22:00:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:46,229 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2024-10-31 22:00:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:00:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2024-10-31 22:00:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-31 22:00:46,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:46,235 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:46,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:00:46,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:46,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1582673848, now seen corresponding path program 1 times [2024-10-31 22:00:46,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:46,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887126221] [2024-10-31 22:00:46,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:00:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:00:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887126221] [2024-10-31 22:00:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887126221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:46,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:46,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:00:46,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279960180] [2024-10-31 22:00:46,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:46,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:00:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:46,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:00:46,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:00:46,940 INFO L87 Difference]: Start difference. First operand 180 states and 259 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:47,113 INFO L93 Difference]: Finished difference Result 439 states and 625 transitions. [2024-10-31 22:00:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:00:47,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-10-31 22:00:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:47,116 INFO L225 Difference]: With dead ends: 439 [2024-10-31 22:00:47,116 INFO L226 Difference]: Without dead ends: 262 [2024-10-31 22:00:47,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-10-31 22:00:47,118 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 49 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:47,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 602 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:00:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-31 22:00:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2024-10-31 22:00:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 231 states have internal predecessors, (316), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 364 transitions. [2024-10-31 22:00:47,172 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 364 transitions. Word has length 100 [2024-10-31 22:00:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:47,173 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 364 transitions. [2024-10-31 22:00:47,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 364 transitions. [2024-10-31 22:00:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-31 22:00:47,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:47,177 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:47,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:00:47,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash -571556598, now seen corresponding path program 1 times [2024-10-31 22:00:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:47,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555545136] [2024-10-31 22:00:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:00:47,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:00:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:00:47,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:00:47,389 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:00:47,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:00:47,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:00:47,396 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-31 22:00:47,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:00:47,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:00:47 BoogieIcfgContainer [2024-10-31 22:00:47,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:00:47,531 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:00:47,531 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:00:47,531 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:00:47,532 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:43" (3/4) ... [2024-10-31 22:00:47,535 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:00:47,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:00:47,542 INFO L158 Benchmark]: Toolchain (without parser) took 5600.31ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 108.5MB in the beginning and 130.4MB in the end (delta: -21.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-31 22:00:47,542 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:00:47,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.37ms. Allocated memory is still 146.8MB. Free memory was 108.0MB in the beginning and 92.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:00:47,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.94ms. Allocated memory is still 146.8MB. Free memory was 92.7MB in the beginning and 88.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:00:47,547 INFO L158 Benchmark]: Boogie Preprocessor took 159.86ms. Allocated memory is still 146.8MB. Free memory was 88.7MB in the beginning and 84.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:00:47,548 INFO L158 Benchmark]: RCFGBuilder took 892.34ms. Allocated memory is still 146.8MB. Free memory was 84.3MB in the beginning and 53.0MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-31 22:00:47,548 INFO L158 Benchmark]: TraceAbstraction took 3812.03ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 114.0MB in the beginning and 131.5MB in the end (delta: -17.5MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-10-31 22:00:47,549 INFO L158 Benchmark]: Witness Printer took 10.30ms. Allocated memory is still 199.2MB. Free memory was 131.5MB in the beginning and 130.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:00:47,550 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.33ms. Allocated memory is still 146.8MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.37ms. Allocated memory is still 146.8MB. Free memory was 108.0MB in the beginning and 92.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.94ms. Allocated memory is still 146.8MB. Free memory was 92.7MB in the beginning and 88.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 159.86ms. Allocated memory is still 146.8MB. Free memory was 88.7MB in the beginning and 84.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 892.34ms. Allocated memory is still 146.8MB. Free memory was 84.3MB in the beginning and 53.0MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3812.03ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 114.0MB in the beginning and 131.5MB in the end (delta: -17.5MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 10.30ms. Allocated memory is still 199.2MB. Free memory was 131.5MB in the beginning and 130.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -200 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -200 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] double_Array_0[1] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] double_Array_0[2] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[2] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L78] EXPR double_Array_0[2] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[1] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[2] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_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, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] RET updateVariables() [L99] CALL step() [L40] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L40] COND TRUE 0.8f > (- float_Array_0[1]) [L41] EXPR unsigned_char_Array_0[0] [L41] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L43] EXPR unsigned_char_Array_0[1] [L43] EXPR unsigned_char_Array_0[1] [L43] unsigned char stepLocal_1 = unsigned_char_Array_0[1] > unsigned_char_Array_0[1]; [L44] EXPR BOOL_unsigned_char_Array_0[0] [L44] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L45] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[1] && stepLocal_0) [L52] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L52] COND TRUE BOOL_unsigned_char_Array_0[1] [L53] EXPR float_Array_0[1] [L53] EXPR float_Array_0[2] [L53] float_Array_0[0] = (float_Array_0[1] - float_Array_0[2]) [L61] EXPR signed_long_int_Array_0[0] [L61] signed long int stepLocal_2 = signed_long_int_Array_0[0]; [L62] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L65] EXPR double_Array_0[1] [L65] EXPR double_Array_0[2] [L65] EXPR float_Array_0[2] [L65] double_Array_0[0] = ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR BOOL_unsigned_char_Array_0[1] [L90] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1 [L90] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) [L90] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))) [L90] EXPR float_Array_0[0] [L90] EXPR float_Array_0[1] [L90] EXPR float_Array_0[2] [L90] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90-L91] return ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 1826 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1192 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 634 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=5, InterpolantAutomatonStates: 20, 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, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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-10-31 22:00:47,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU --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 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:00:50,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:00:50,333 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:00:50,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:00:50,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:00:50,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:00:50,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:00:50,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:00:50,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:00:50,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:00:50,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:00:50,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:00:50,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:00:50,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:00:50,386 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:00:50,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:00:50,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:00:50,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:00:50,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:00:50,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:00:50,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:00:50,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:00:50,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:00:50,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:00:50,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:00:50,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:00:50,394 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:00:50,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:00:50,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:00:50,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:00:50,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:00:50,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:00:50,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:00:50,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:00:50,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:50,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:00:50,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:00:50,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:00:50,397 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:00:50,398 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:00:50,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:00:50,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:00:50,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:00:50,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:00:50,399 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:00:50,399 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_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 [2024-10-31 22:00:50,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:00:50,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:00:50,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:00:50,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:00:50,841 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:00:50,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i Unable to find full path for "g++" [2024-10-31 22:00:53,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:00:53,369 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:00:53,369 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-10-31 22:00:53,382 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/data/a8c7d940b/01f8b599504a4e43b457db5ec389797a/FLAG08b49973c [2024-10-31 22:00:53,398 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/data/a8c7d940b/01f8b599504a4e43b457db5ec389797a [2024-10-31 22:00:53,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:00:53,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:00:53,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:53,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:00:53,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:00:53,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:53,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f79e5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53, skipping insertion in model container [2024-10-31 22:00:53,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:53,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:00:53,700 WARN L251 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_b7aa0856-88a8-40c8-9aa5-442014b3849d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i[916,929] [2024-10-31 22:00:53,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:53,815 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:00:53,829 WARN L251 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_b7aa0856-88a8-40c8-9aa5-442014b3849d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i[916,929] [2024-10-31 22:00:53,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:53,927 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:00:53,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53 WrapperNode [2024-10-31 22:00:53,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:53,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:53,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:00:53,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:00:53,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:53,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,028 INFO L138 Inliner]: procedures = 36, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-10-31 22:00:54,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:54,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:00:54,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:00:54,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:00:54,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,095 INFO L175 MemorySlicer]: Split 110 memory accesses to 6 slices as follows [2, 16, 21, 39, 9, 23]. 35 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 3, 3, 1, 2]. The 15 writes are split as follows [0, 2, 4, 5, 2, 2]. [2024-10-31 22:00:54,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:00:54,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:00:54,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:00:54,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:00:54,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (1/1) ... [2024-10-31 22:00:54,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:54,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:00:54,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:00:54,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:00:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:00:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-31 22:00:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-31 22:00:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-31 22:00:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-31 22:00:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-31 22:00:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-31 22:00:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-31 22:00:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-31 22:00:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-31 22:00:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-31 22:00:54,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-31 22:00:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-31 22:00:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 22:00:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 22:00:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-31 22:00:54,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-31 22:00:54,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-31 22:00:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-31 22:00:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:00:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:00:54,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-31 22:00:54,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-31 22:00:54,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-31 22:00:54,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-31 22:00:54,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-31 22:00:54,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-31 22:00:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-31 22:00:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-31 22:00:54,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-31 22:00:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-31 22:00:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-31 22:00:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-31 22:00:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-31 22:00:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-31 22:00:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-31 22:00:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-31 22:00:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-31 22:00:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-31 22:00:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-31 22:00:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-31 22:00:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-31 22:00:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-31 22:00:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-31 22:00:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-31 22:00:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-31 22:00:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-31 22:00:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-31 22:00:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-31 22:00:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-31 22:00:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-31 22:00:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-31 22:00:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-31 22:00:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-31 22:00:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-31 22:00:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-31 22:00:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-31 22:00:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-31 22:00:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-31 22:00:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-31 22:00:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-31 22:00:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:00:54,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:00:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:00:54,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:00:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 22:00:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 22:00:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-31 22:00:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-31 22:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-31 22:00:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-31 22:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-31 22:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-31 22:00:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-31 22:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-31 22:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-31 22:00:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-31 22:00:54,542 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:00:54,545 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:00:56,517 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-10-31 22:00:56,517 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:00:56,546 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:00:56,547 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:00:56,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:56 BoogieIcfgContainer [2024-10-31 22:00:56,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:00:56,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:00:56,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:00:56,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:00:56,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:00:53" (1/3) ... [2024-10-31 22:00:56,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b39c231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:56, skipping insertion in model container [2024-10-31 22:00:56,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:53" (2/3) ... [2024-10-31 22:00:56,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b39c231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:56, skipping insertion in model container [2024-10-31 22:00:56,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:56" (3/3) ... [2024-10-31 22:00:56,564 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-78.i [2024-10-31 22:00:56,587 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:00:56,587 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:00:56,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:00:56,697 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;@1115dd33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:00:56,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:00:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:00:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:56,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:56,723 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:56,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:56,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:56,733 INFO L85 PathProgramCache]: Analyzing trace with hash -438494555, now seen corresponding path program 1 times [2024-10-31 22:00:56,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:00:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087022075] [2024-10-31 22:00:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:56,754 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-10-31 22:00:56,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:00:56,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:56,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:00:57,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:00:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-31 22:00:57,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:00:57,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:00:57,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087022075] [2024-10-31 22:00:57,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087022075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:57,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:57,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:00:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045129288] [2024-10-31 22:00:57,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:57,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:00:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:00:57,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:00:57,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:00:57,592 INFO L87 Difference]: Start difference. First operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:57,633 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-10-31 22:00:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:00:57,638 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-10-31 22:00:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:57,647 INFO L225 Difference]: With dead ends: 179 [2024-10-31 22:00:57,647 INFO L226 Difference]: Without dead ends: 89 [2024-10-31 22:00:57,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:00:57,659 INFO L432 NwaCegarLoop]: 129 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, 129 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-10-31 22:00:57,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-31 22:00:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-31 22:00:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:00:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-10-31 22:00:57,723 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2024-10-31 22:00:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:57,724 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-10-31 22:00:57,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-10-31 22:00:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:57,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:57,733 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:57,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:57,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:57,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1706018639, now seen corresponding path program 1 times [2024-10-31 22:00:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:00:57,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561413419] [2024-10-31 22:00:57,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:57,941 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-10-31 22:00:57,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:00:57,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:57,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:58,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:00:58,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:00:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:00:58,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:00:58,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:00:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561413419] [2024-10-31 22:00:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561413419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859640396] [2024-10-31 22:00:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:58,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:00:58,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:58,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:58,690 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:58,811 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-10-31 22:00:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:58,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-10-31 22:00:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:58,816 INFO L225 Difference]: With dead ends: 177 [2024-10-31 22:00:58,818 INFO L226 Difference]: Without dead ends: 91 [2024-10-31 22:00:58,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:58,822 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-10-31 22:00:58,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:00:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-31 22:00:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-31 22:00:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:00:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-10-31 22:00:58,847 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2024-10-31 22:00:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:58,852 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-10-31 22:00:58,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:00:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-10-31 22:00:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:58,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:58,859 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:58,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-31 22:00:59,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:59,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:59,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash 322567471, now seen corresponding path program 1 times [2024-10-31 22:00:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:00:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671521533] [2024-10-31 22:00:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:59,069 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-10-31 22:00:59,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:00:59,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:59,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:00:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:59,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:00:59,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:01:00,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:01:00,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:01:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671521533] [2024-10-31 22:01:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671521533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:00,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4975433] [2024-10-31 22:01:00,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:00,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:00,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:01:00,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:00,825 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:01:02,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:01:04,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 22:01:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:04,553 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2024-10-31 22:01:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:04,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-10-31 22:01:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:04,559 INFO L225 Difference]: With dead ends: 267 [2024-10-31 22:01:04,560 INFO L226 Difference]: Without dead ends: 179 [2024-10-31 22:01:04,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:04,566 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:04,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-31 22:01:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-31 22:01:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-10-31 22:01:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 153 states have internal predecessors, (215), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:01:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2024-10-31 22:01:04,610 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 98 [2024-10-31 22:01:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:04,611 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2024-10-31 22:01:04,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:01:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2024-10-31 22:01:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:01:04,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:04,619 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:01:04,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-31 22:01:04,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:04,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -688549779, now seen corresponding path program 1 times [2024-10-31 22:01:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:01:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896344065] [2024-10-31 22:01:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:04,822 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-10-31 22:01:04,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:01:04,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:04,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:05,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 22:01:05,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 18 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-31 22:01:06,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:01:06,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:01:06,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896344065] [2024-10-31 22:01:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896344065] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:06,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 22:01:06,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-31 22:01:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549589311] [2024-10-31 22:01:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:06,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:01:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:01:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:01:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:01:06,445 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:01:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:06,907 INFO L93 Difference]: Finished difference Result 427 states and 613 transitions. [2024-10-31 22:01:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:01:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-10-31 22:01:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:06,911 INFO L225 Difference]: With dead ends: 427 [2024-10-31 22:01:06,911 INFO L226 Difference]: Without dead ends: 254 [2024-10-31 22:01:06,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:01:06,917 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 49 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:06,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 487 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:01:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-31 22:01:06,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2024-10-31 22:01:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 221 states have (on average 1.3936651583710407) internal successors, (308), 223 states have internal predecessors, (308), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:01:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 356 transitions. [2024-10-31 22:01:06,974 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 356 transitions. Word has length 98 [2024-10-31 22:01:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:06,977 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 356 transitions. [2024-10-31 22:01:06,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:01:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 356 transitions. [2024-10-31 22:01:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:01:06,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:06,983 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:01:07,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-31 22:01:07,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:07,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:07,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash -946715217, now seen corresponding path program 1 times [2024-10-31 22:01:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:01:07,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810885966] [2024-10-31 22:01:07,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:07,186 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-10-31 22:01:07,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:01:07,190 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:07,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:07,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:01:07,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:01:07,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:01:07,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:01:07,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810885966] [2024-10-31 22:01:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810885966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:07,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:07,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128177998] [2024-10-31 22:01:07,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:07,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:01:07,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:07,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:07,708 INFO L87 Difference]: Start difference. First operand 250 states and 356 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:01:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:07,776 INFO L93 Difference]: Finished difference Result 505 states and 721 transitions. [2024-10-31 22:01:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-10-31 22:01:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:07,781 INFO L225 Difference]: With dead ends: 505 [2024-10-31 22:01:07,781 INFO L226 Difference]: Without dead ends: 258 [2024-10-31 22:01:07,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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-10-31 22:01:07,783 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-10-31 22:01:07,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:01:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-31 22:01:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-31 22:01:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 231 states have internal predecessors, (316), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:01:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 364 transitions. [2024-10-31 22:01:07,812 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 364 transitions. Word has length 98 [2024-10-31 22:01:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 364 transitions. [2024-10-31 22:01:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:01:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 364 transitions. [2024-10-31 22:01:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-31 22:01:07,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:07,815 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:01:07,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-31 22:01:08,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:08,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:08,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash -571556598, now seen corresponding path program 1 times [2024-10-31 22:01:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:01:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846922926] [2024-10-31 22:01:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:08,017 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-10-31 22:01:08,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:01:08,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:08,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7aa0856-88a8-40c8-9aa5-442014b3849d/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:01:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:08,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-31 22:01:08,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:08,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:01:08,966 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 175 treesize of output 67 [2024-10-31 22:01:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:01:09,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:01:09,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:01:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846922926] [2024-10-31 22:01:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846922926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:09,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:09,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:01:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965296053] [2024-10-31 22:01:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:09,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:01:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:01:09,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:01:09,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:01:09,076 INFO L87 Difference]: Start difference. First operand 258 states and 364 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:01:11,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []