./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:04,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:04,757 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:57:04,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:04,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:04,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:04,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:04,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:04,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:04,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:04,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:04,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:04,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:04,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:04,803 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:04,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:04,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:04,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:04,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:04,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:04,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:04,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:04,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:04,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:04,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:04,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:04,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:04,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:04,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:04,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:04,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:04,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:04,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:04,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:04,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:04,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:04,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:04,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:04,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:04,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:04,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:04,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:04,834 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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 -> c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e [2024-10-31 21:57:05,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:05,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:05,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:05,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:05,210 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:05,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i Unable to find full path for "g++" [2024-10-31 21:57:07,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:07,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:07,654 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i [2024-10-31 21:57:07,667 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/data/c2509cea1/73f7aa5ba3f448509ffce06b7958cd0b/FLAG3fc91c569 [2024-10-31 21:57:07,683 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/data/c2509cea1/73f7aa5ba3f448509ffce06b7958cd0b [2024-10-31 21:57:07,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:07,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:07,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:07,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:07,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:07,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:07" (1/1) ... [2024-10-31 21:57:07,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd5257d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:07, skipping insertion in model container [2024-10-31 21:57:07,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:07" (1/1) ... [2024-10-31 21:57:07,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:07,952 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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2024-10-31 21:57:08,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:08,048 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:08,061 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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2024-10-31 21:57:08,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:08,147 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:08,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08 WrapperNode [2024-10-31 21:57:08,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:08,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:08,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:08,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:08,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,225 INFO L138 Inliner]: procedures = 29, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 587 [2024-10-31 21:57:08,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:08,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:08,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:08,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:08,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,276 INFO L175 MemorySlicer]: Split 141 memory accesses to 6 slices as follows [2, 22, 18, 39, 13, 47]. 33 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 4]. The 17 writes are split as follows [0, 3, 2, 4, 3, 5]. [2024-10-31 21:57:08,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:08,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:08,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:08,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:08,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (1/1) ... [2024-10-31 21:57:08,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:08,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:08,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:08,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:08,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:57:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:57:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 21:57:08,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 21:57:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 21:57:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 21:57:08,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 21:57:08,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 21:57:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 21:57:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 21:57:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 21:57:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 21:57:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 21:57:08,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 21:57:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 21:57:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 21:57:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 21:57:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 21:57:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 21:57:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 21:57:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 21:57:08,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 21:57:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 21:57:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 21:57:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 21:57:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 21:57:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 21:57:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 21:57:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 21:57:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 21:57:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:57:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 21:57:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 21:57:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 21:57:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 21:57:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:08,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:08,636 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:08,638 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:09,539 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:09,539 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:09,558 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:09,558 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:09,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:09 BoogieIcfgContainer [2024-10-31 21:57:09,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:09,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:09,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:09,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:09,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:07" (1/3) ... [2024-10-31 21:57:09,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cd7ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:09, skipping insertion in model container [2024-10-31 21:57:09,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:08" (2/3) ... [2024-10-31 21:57:09,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cd7ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:09, skipping insertion in model container [2024-10-31 21:57:09,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:09" (3/3) ... [2024-10-31 21:57:09,569 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-11.i [2024-10-31 21:57:09,589 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:09,590 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:09,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:09,694 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;@4c749eaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:09,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 21:57:09,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:09,741 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:09,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash -825630552, now seen corresponding path program 1 times [2024-10-31 21:57:09,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671853381] [2024-10-31 21:57:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:57:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:57:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:57:10,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:10,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671853381] [2024-10-31 21:57:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671853381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:10,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:10,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:10,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906395699] [2024-10-31 21:57:10,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:10,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:10,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:10,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:10,493 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:57:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:10,551 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-10-31 21:57:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:10,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-10-31 21:57:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:10,566 INFO L225 Difference]: With dead ends: 271 [2024-10-31 21:57:10,566 INFO L226 Difference]: Without dead ends: 135 [2024-10-31 21:57:10,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:10,577 INFO L432 NwaCegarLoop]: 201 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, 201 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 21:57:10,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-31 21:57:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-31 21:57:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-10-31 21:57:10,646 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-10-31 21:57:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:10,647 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-10-31 21:57:10,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:57:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-10-31 21:57:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 21:57:10,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:10,652 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:10,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:10,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1635399696, now seen corresponding path program 1 times [2024-10-31 21:57:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268101559] [2024-10-31 21:57:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:57:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:57:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:57:11,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:11,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268101559] [2024-10-31 21:57:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268101559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:11,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:11,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:11,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407620194] [2024-10-31 21:57:11,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:11,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:11,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:11,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:11,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:11,201 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:57:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:11,277 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2024-10-31 21:57:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:11,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-10-31 21:57:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:11,280 INFO L225 Difference]: With dead ends: 269 [2024-10-31 21:57:11,280 INFO L226 Difference]: Without dead ends: 137 [2024-10-31 21:57:11,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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 21:57:11,282 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 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 21:57:11,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-31 21:57:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-31 21:57:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-10-31 21:57:11,310 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133 [2024-10-31 21:57:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:11,312 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-10-31 21:57:11,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:57:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-10-31 21:57:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 21:57:11,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:11,319 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:11,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:57:11,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:11,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:11,322 INFO L85 PathProgramCache]: Analyzing trace with hash -700992814, now seen corresponding path program 1 times [2024-10-31 21:57:11,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:11,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770651162] [2024-10-31 21:57:11,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:11,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:57:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:57:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:57:11,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770651162] [2024-10-31 21:57:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770651162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:11,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552763704] [2024-10-31 21:57:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:11,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:11,652 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:11,685 INFO L93 Difference]: Finished difference Result 273 states and 406 transitions. [2024-10-31 21:57:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-10-31 21:57:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:11,691 INFO L225 Difference]: With dead ends: 273 [2024-10-31 21:57:11,691 INFO L226 Difference]: Without dead ends: 139 [2024-10-31 21:57:11,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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 21:57:11,693 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 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 21:57:11,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-31 21:57:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-31 21:57:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 121 states have internal predecessors, (173), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2024-10-31 21:57:11,718 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 133 [2024-10-31 21:57:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:11,719 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2024-10-31 21:57:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2024-10-31 21:57:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-31 21:57:11,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:11,723 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:11,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:57:11,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:11,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash 532923702, now seen corresponding path program 1 times [2024-10-31 21:57:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733315702] [2024-10-31 21:57:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:57:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:57:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:57:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733315702] [2024-10-31 21:57:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733315702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:12,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:12,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:12,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649832843] [2024-10-31 21:57:12,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:12,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:12,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:12,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:12,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:12,125 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:12,181 INFO L93 Difference]: Finished difference Result 278 states and 411 transitions. [2024-10-31 21:57:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:12,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-10-31 21:57:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:12,187 INFO L225 Difference]: With dead ends: 278 [2024-10-31 21:57:12,187 INFO L226 Difference]: Without dead ends: 142 [2024-10-31 21:57:12,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:12,192 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:12,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-31 21:57:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-31 21:57:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 124 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-10-31 21:57:12,212 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 135 [2024-10-31 21:57:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:12,212 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-10-31 21:57:12,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-10-31 21:57:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-31 21:57:12,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:12,216 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:12,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:57:12,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 644923378, now seen corresponding path program 1 times [2024-10-31 21:57:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:12,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236290806] [2024-10-31 21:57:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:57:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:57:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:57:12,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236290806] [2024-10-31 21:57:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236290806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:12,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:12,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867125257] [2024-10-31 21:57:12,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:12,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:12,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:12,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:12,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:12,513 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:12,552 INFO L93 Difference]: Finished difference Result 284 states and 417 transitions. [2024-10-31 21:57:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:12,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-31 21:57:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:12,555 INFO L225 Difference]: With dead ends: 284 [2024-10-31 21:57:12,555 INFO L226 Difference]: Without dead ends: 145 [2024-10-31 21:57:12,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:12,557 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:12,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-31 21:57:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2024-10-31 21:57:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2024-10-31 21:57:12,576 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 136 [2024-10-31 21:57:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:12,576 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2024-10-31 21:57:12,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2024-10-31 21:57:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-31 21:57:12,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:12,582 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:12,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:57:12,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:12,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1837313301, now seen corresponding path program 1 times [2024-10-31 21:57:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:12,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013712867] [2024-10-31 21:57:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:12,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:57:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:57:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:57:12,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:12,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013712867] [2024-10-31 21:57:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013712867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:12,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:57:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030940628] [2024-10-31 21:57:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:12,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:12,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:12,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:12,944 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:13,005 INFO L93 Difference]: Finished difference Result 287 states and 420 transitions. [2024-10-31 21:57:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:13,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-10-31 21:57:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:13,009 INFO L225 Difference]: With dead ends: 287 [2024-10-31 21:57:13,009 INFO L226 Difference]: Without dead ends: 147 [2024-10-31 21:57:13,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:13,010 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:13,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:13,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-31 21:57:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-10-31 21:57:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-10-31 21:57:13,027 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 137 [2024-10-31 21:57:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:13,027 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-10-31 21:57:13,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-10-31 21:57:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-31 21:57:13,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:13,030 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:13,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:57:13,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:13,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash 492739464, now seen corresponding path program 1 times [2024-10-31 21:57:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:13,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398674217] [2024-10-31 21:57:13,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:57:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:57:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:57:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:57:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:57:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398674217] [2024-10-31 21:57:13,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398674217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:13,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:13,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500861855] [2024-10-31 21:57:13,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:13,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:13,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:13,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:13,354 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:13,403 INFO L93 Difference]: Finished difference Result 288 states and 421 transitions. [2024-10-31 21:57:13,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:13,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-10-31 21:57:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:13,406 INFO L225 Difference]: With dead ends: 288 [2024-10-31 21:57:13,407 INFO L226 Difference]: Without dead ends: 147 [2024-10-31 21:57:13,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:13,409 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:13,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-31 21:57:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-31 21:57:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 129 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2024-10-31 21:57:13,428 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 137 [2024-10-31 21:57:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:13,432 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2024-10-31 21:57:13,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:57:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2024-10-31 21:57:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-31 21:57:13,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:13,435 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:13,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:57:13,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:13,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash -361182215, now seen corresponding path program 1 times [2024-10-31 21:57:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362154464] [2024-10-31 21:57:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:13,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:57:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:13,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:57:13,650 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:57:13,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:57:13,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:57:13,656 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:13,759 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:57:13,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:57:13 BoogieIcfgContainer [2024-10-31 21:57:13,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:57:13,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:57:13,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:57:13,770 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:57:13,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:09" (3/4) ... [2024-10-31 21:57:13,773 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:57:13,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:57:13,775 INFO L158 Benchmark]: Toolchain (without parser) took 6088.21ms. Allocated memory was 155.2MB in the beginning and 260.0MB in the end (delta: 104.9MB). Free memory was 121.4MB in the beginning and 155.0MB in the end (delta: -33.6MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2024-10-31 21:57:13,776 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 155.2MB. Free memory was 123.4MB in the beginning and 123.3MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:13,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.26ms. Allocated memory is still 155.2MB. Free memory was 120.9MB in the beginning and 103.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:13,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.02ms. Allocated memory is still 155.2MB. Free memory was 103.7MB in the beginning and 99.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:57:13,777 INFO L158 Benchmark]: Boogie Preprocessor took 110.38ms. Allocated memory is still 155.2MB. Free memory was 99.0MB in the beginning and 93.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 21:57:13,778 INFO L158 Benchmark]: RCFGBuilder took 1221.00ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 93.6MB in the beginning and 176.6MB in the end (delta: -82.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2024-10-31 21:57:13,778 INFO L158 Benchmark]: TraceAbstraction took 4207.61ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 175.5MB in the beginning and 155.0MB in the end (delta: 20.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-10-31 21:57:13,778 INFO L158 Benchmark]: Witness Printer took 5.40ms. Allocated memory is still 260.0MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:13,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 155.2MB. Free memory was 123.4MB in the beginning and 123.3MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.26ms. Allocated memory is still 155.2MB. Free memory was 120.9MB in the beginning and 103.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.02ms. Allocated memory is still 155.2MB. Free memory was 103.7MB in the beginning and 99.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.38ms. Allocated memory is still 155.2MB. Free memory was 99.0MB in the beginning and 93.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1221.00ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 93.6MB in the beginning and 176.6MB in the end (delta: -82.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4207.61ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 175.5MB in the beginning and 155.0MB in the end (delta: 20.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. * Witness Printer took 5.40ms. Allocated memory is still 260.0MB. Free memory is still 155.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 someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 1 }; [L25-L27] double double_Array_0[2] = { 7.675, 50.75 }; [L25-L27] double double_Array_0[2] = { 7.675, 50.75 }; [L25-L27] double double_Array_0[2] = { 7.675, 50.75 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L28-L30] float float_Array_0[3] = { 1000000.7, 32.5, 2.4 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -16 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -16 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -16 }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L34-L36] unsigned char unsigned_char_Array_0[2][2] = { {10, 5}, {1, 200} }; [L37] unsigned char last_1_BOOL_unsigned_char_Array_0_2_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR BOOL_unsigned_char_Array_0[2] [L98] last_1_BOOL_unsigned_char_Array_0_2_ = BOOL_unsigned_char_Array_0[2] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] double_Array_0[0] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[0] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L77] EXPR double_Array_0[0] [L77] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] double_Array_0[1] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[1] [L79] EXPR double_Array_0[1] >= 0.0F && 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L79] EXPR double_Array_0[1] [L79] EXPR double_Array_0[1] >= 0.0F && 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] float_Array_0[0] = __VERIFIER_nondet_float() [L81] EXPR float_Array_0[0] [L81] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L81] EXPR float_Array_0[0] [L81] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] float_Array_0[2] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[2] [L83] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L83] EXPR float_Array_0[2] [L83] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L88] EXPR 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] EXPR 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L91] EXPR 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1][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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] EXPR 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1][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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L94] EXPR 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1][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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] EXPR 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L109] RET updateVariables() [L110] CALL step() [L41] EXPR double_Array_0[0] [L41] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L41] COND FALSE !(double_Array_0[0] >= double_Array_0[1]) [L50] EXPR float_Array_0[1] [L50] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L50] COND FALSE !(float_Array_0[1] <= float_Array_0[1]) [L53] EXPR BOOL_unsigned_char_Array_0[2] [L53] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L54] EXPR double_Array_0[1] [L54] EXPR float_Array_0[1] [L54] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L54] COND FALSE !((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) [L63] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L63] COND FALSE !(! BOOL_unsigned_char_Array_0[2]) [L66] EXPR unsigned_char_Array_0[0][0] [L66] unsigned_char_Array_0[0][1] = unsigned_char_Array_0[0][0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR double_Array_0[1] [L101] EXPR float_Array_0[1] [L101] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1 [L101] EXPR BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] [L101] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1 [L101] EXPR float_Array_0[1] [L101] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) [L101] EXPR signed_char_Array_0[1] [L101] EXPR signed_char_Array_0[0] [L101] EXPR (float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR ((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101] EXPR (((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L101-L102] return (((((double_Array_0[1] - 5.25) < (float_Array_0[1] * (float_Array_0[1] * 199.4))) ? ((BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[2]) ? ((float_Array_0[1] < float_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) : 1) : 1) && ((double_Array_0[0] >= double_Array_0[1]) ? (last_1_BOOL_unsigned_char_Array_0_2_ ? ((! last_1_BOOL_unsigned_char_Array_0_2_) ? (float_Array_0[1] == ((float) ((((float_Array_0[0]) > ((10.25f + float_Array_0[2]))) ? (float_Array_0[0]) : ((10.25f + float_Array_0[2])))))) : (float_Array_0[1] == ((float) float_Array_0[0]))) : 1) : 1)) && ((float_Array_0[1] <= float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]))) : 1)) && ((! BOOL_unsigned_char_Array_0[2]) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((((((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) < (unsigned_char_Array_0[1][0])) ? (((((unsigned_char_Array_0[1][1]) < (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))) ? (unsigned_char_Array_0[1][1]) : (((((unsigned_char_Array_0[0][0]) > (5)) ? (unsigned_char_Array_0[0][0]) : (5))))))) : (unsigned_char_Array_0[1][0]))))) : (unsigned_char_Array_0[0][1] == ((unsigned char) unsigned_char_Array_0[0][0]))) ; [L111] RET, EXPR property() [L111] 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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_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, last_1_BOOL_unsigned_char_Array_0_2_=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 4665 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3275 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1390 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1082 NumberOfCodeBlocks, 1082 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 937 ConstructedInterpolants, 0 QuantifiedInterpolants, 960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 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 21:57:13,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:16,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:16,420 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 21:57:16,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:16,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:16,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:16,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:16,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:16,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:16,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:16,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:16,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:16,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:16,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:16,469 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:16,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:16,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:16,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:16,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:16,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:16,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:16,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:16,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:16,477 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:57:16,477 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 21:57:16,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:16,478 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 21:57:16,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:16,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:16,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:16,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:16,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:16,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:16,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:16,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:16,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:16,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:16,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:16,485 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 21:57:16,485 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 21:57:16,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:16,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:16,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:16,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:16,487 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 21:57:16,487 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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 -> c5ad413464bb2736d6f435d51cb1326f1acaeab748db29ebf4ec341c12bfbc5e [2024-10-31 21:57:16,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:16,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:16,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:16,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:16,939 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:16,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i Unable to find full path for "g++" [2024-10-31 21:57:19,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:19,483 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:19,487 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i [2024-10-31 21:57:19,500 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/data/233d83de9/22289c6184b14952a827da152de8565e/FLAG53ba2c3c2 [2024-10-31 21:57:19,513 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/data/233d83de9/22289c6184b14952a827da152de8565e [2024-10-31 21:57:19,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:19,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:19,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:19,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:19,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:19,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:19,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e8a770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19, skipping insertion in model container [2024-10-31 21:57:19,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:19,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:19,732 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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2024-10-31 21:57:19,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:19,824 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:19,837 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_61cbc661-0922-49f5-ab8d-a91b0eabfffe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-11.i[916,929] [2024-10-31 21:57:19,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:19,980 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:19,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19 WrapperNode [2024-10-31 21:57:19,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:19,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:19,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:19,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:19,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,117 INFO L138 Inliner]: procedures = 33, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2024-10-31 21:57:20,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:20,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:20,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:20,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:20,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,190 INFO L175 MemorySlicer]: Split 141 memory accesses to 6 slices as follows [2, 22, 18, 39, 13, 47]. 33 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 4]. The 17 writes are split as follows [0, 3, 2, 4, 3, 5]. [2024-10-31 21:57:20,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:20,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:20,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:20,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:20,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (1/1) ... [2024-10-31 21:57:20,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:20,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:20,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:20,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-31 21:57:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-31 21:57:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-31 21:57:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-31 21:57:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-31 21:57:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-31 21:57:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-31 21:57:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-31 21:57:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-31 21:57:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-31 21:57:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-31 21:57:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-31 21:57:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 21:57:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 21:57:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-31 21:57:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-31 21:57:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-31 21:57:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-31 21:57:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 21:57:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 21:57:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-31 21:57:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-31 21:57:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-31 21:57:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-31 21:57:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-31 21:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-31 21:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-31 21:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-31 21:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-31 21:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-31 21:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-31 21:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-31 21:57:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-31 21:57:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-31 21:57:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-31 21:57:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-31 21:57:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-31 21:57:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-31 21:57:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-31 21:57:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-31 21:57:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-31 21:57:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-31 21:57:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-31 21:57:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-31 21:57:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-31 21:57:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-31 21:57:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-31 21:57:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-31 21:57:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:20,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:20,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 21:57:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 21:57:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-31 21:57:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-31 21:57:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-31 21:57:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-31 21:57:20,576 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:20,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:39,243 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:39,243 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:39,263 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:39,264 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:39,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:39 BoogieIcfgContainer [2024-10-31 21:57:39,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:39,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:39,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:39,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:39,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:19" (1/3) ... [2024-10-31 21:57:39,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad24cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:39, skipping insertion in model container [2024-10-31 21:57:39,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:19" (2/3) ... [2024-10-31 21:57:39,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad24cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:39, skipping insertion in model container [2024-10-31 21:57:39,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:39" (3/3) ... [2024-10-31 21:57:39,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-11.i [2024-10-31 21:57:39,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:39,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:39,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:39,399 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;@5d06fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:39,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 21:57:39,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:39,419 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:39,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:39,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:39,425 INFO L85 PathProgramCache]: Analyzing trace with hash -825630552, now seen corresponding path program 1 times [2024-10-31 21:57:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:57:39,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533765522] [2024-10-31 21:57:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:39,440 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 21:57:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:57:39,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 21:57:39,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 21:57:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 21:57:40,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-10-31 21:57:40,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:57:40,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 21:57:40,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533765522] [2024-10-31 21:57:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533765522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:40,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:40,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341578959] [2024-10-31 21:57:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:40,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:40,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 21:57:40,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:40,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:40,777 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:57:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:40,814 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions. [2024-10-31 21:57:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-10-31 21:57:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:40,830 INFO L225 Difference]: With dead ends: 271 [2024-10-31 21:57:40,830 INFO L226 Difference]: Without dead ends: 135 [2024-10-31 21:57:40,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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 21:57:40,837 INFO L432 NwaCegarLoop]: 201 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, 201 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 21:57:40,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-31 21:57:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-31 21:57:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:57:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-10-31 21:57:40,908 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133 [2024-10-31 21:57:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:40,909 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-10-31 21:57:40,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:57:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-10-31 21:57:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 21:57:40,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:40,921 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:40,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 21:57:41,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 21:57:41,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:41,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1635399696, now seen corresponding path program 1 times [2024-10-31 21:57:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:57:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752767784] [2024-10-31 21:57:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:41,126 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 21:57:41,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:57:41,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 21:57:41,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61cbc661-0922-49f5-ab8d-a91b0eabfffe/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 21:57:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 21:57:42,201 INFO L278 TraceCheckSpWp]: Computing forward predicates...