./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/invert_string-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/config/KojakReach.xml -i ../../sv-benchmarks/c/loops/invert_string-3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 08:50:40,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 08:50:40,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 08:50:40,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 08:50:40,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 08:50:40,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 08:50:40,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 08:50:40,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 08:50:40,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 08:50:40,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 08:50:40,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 08:50:40,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 08:50:40,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 08:50:40,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 08:50:40,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 08:50:40,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 08:50:40,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 08:50:40,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 08:50:40,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 08:50:40,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 08:50:40,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 08:50:40,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 08:50:40,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 08:50:40,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 08:50:40,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 08:50:40,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 08:50:40,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 08:50:40,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 08:50:40,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 08:50:40,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 08:50:40,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 08:50:40,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 08:50:40,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 08:50:40,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 08:50:40,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 08:50:40,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 08:50:40,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 08:50:40,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 08:50:40,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 08:50:40,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 08:50:40,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 08:50:40,757 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-11-16 08:50:40,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 08:50:40,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 08:50:40,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 08:50:40,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-11-16 08:50:40,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 08:50:40,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 08:50:40,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 08:50:40,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 08:50:40,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 08:50:40,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 08:50:40,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 08:50:40,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 08:50:40,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 08:50:40,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 08:50:40,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 08:50:40,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 08:50:40,790 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 08:50:40,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 08:50:40,790 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-11-16 08:50:40,791 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-11-16 08:50:40,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 08:50:40,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-11-16 08:50:40,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 08:50:40,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 08:50:40,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 08:50:40,793 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-11-16 08:50:40,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 08:50:40,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 08:50:40,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/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_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Kojak 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 -> ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 [2022-11-16 08:50:41,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 08:50:41,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 08:50:41,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 08:50:41,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 08:50:41,195 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 08:50:41,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/../../sv-benchmarks/c/loops/invert_string-3.c [2022-11-16 08:50:41,298 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/data/871ab7241/65b611c3552d442dad5365343dbe554e/FLAGceeb72966 [2022-11-16 08:50:41,970 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 08:50:41,971 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/sv-benchmarks/c/loops/invert_string-3.c [2022-11-16 08:50:41,979 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/data/871ab7241/65b611c3552d442dad5365343dbe554e/FLAGceeb72966 [2022-11-16 08:50:42,312 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/data/871ab7241/65b611c3552d442dad5365343dbe554e [2022-11-16 08:50:42,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 08:50:42,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 08:50:42,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 08:50:42,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 08:50:42,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 08:50:42,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46cc576f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42, skipping insertion in model container [2022-11-16 08:50:42,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 08:50:42,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 08:50:42,656 WARN L229 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_0d20348f-90f0-4a61-a110-251947be56c7/sv-benchmarks/c/loops/invert_string-3.c[327,340] [2022-11-16 08:50:42,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 08:50:42,707 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 08:50:42,732 WARN L229 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_0d20348f-90f0-4a61-a110-251947be56c7/sv-benchmarks/c/loops/invert_string-3.c[327,340] [2022-11-16 08:50:42,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 08:50:42,770 INFO L208 MainTranslator]: Completed translation [2022-11-16 08:50:42,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42 WrapperNode [2022-11-16 08:50:42,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 08:50:42,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 08:50:42,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 08:50:42,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 08:50:42,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,845 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2022-11-16 08:50:42,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 08:50:42,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 08:50:42,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 08:50:42,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 08:50:42,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,889 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 08:50:42,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 08:50:42,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 08:50:42,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 08:50:42,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:50:42" (1/1) ... [2022-11-16 08:50:42,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-11-16 08:50:42,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/z3 [2022-11-16 08:50:42,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-11-16 08:50:42,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-11-16 08:50:43,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 08:50:43,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 08:50:43,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 08:50:43,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 08:50:43,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 08:50:43,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 08:50:43,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 08:50:43,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 08:50:43,121 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 08:50:43,124 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 08:50:43,401 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 08:50:43,454 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 08:50:43,454 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 08:50:43,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:50:43 BoogieIcfgContainer [2022-11-16 08:50:43,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 08:50:43,459 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-11-16 08:50:43,459 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-11-16 08:50:43,473 INFO L275 PluginConnector]: CodeCheck initialized [2022-11-16 08:50:43,473 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:50:43" (1/1) ... [2022-11-16 08:50:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 08:50:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 9 states and 12 transitions. [2022-11-16 08:50:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-11-16 08:50:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 08:50:43,598 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:43,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:50:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 10 states and 13 transitions. [2022-11-16 08:50:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-11-16 08:50:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 08:50:44,423 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 08:50:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 11 states and 14 transitions. [2022-11-16 08:50:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-11-16 08:50:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 08:50:44,964 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 08:50:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 12 states and 15 transitions. [2022-11-16 08:50:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2022-11-16 08:50:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 08:50:45,534 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:45,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 08:50:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 13 states and 16 transitions. [2022-11-16 08:50:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-11-16 08:50:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 08:50:46,502 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 08:50:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 14 states and 17 transitions. [2022-11-16 08:50:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-11-16 08:50:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 08:50:47,566 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 08:50:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 15 states and 18 transitions. [2022-11-16 08:50:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-11-16 08:50:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 08:50:48,676 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:50:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 17 states and 23 transitions. [2022-11-16 08:50:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-11-16 08:50:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 08:50:51,301 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:50:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 18 states and 26 transitions. [2022-11-16 08:50:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-11-16 08:50:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 08:50:52,451 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:52,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:50:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 19 states and 29 transitions. [2022-11-16 08:50:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2022-11-16 08:50:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 08:50:53,561 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:50:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 20 states and 29 transitions. [2022-11-16 08:50:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2022-11-16 08:50:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 08:50:54,321 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:50:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 21 states and 31 transitions. [2022-11-16 08:50:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2022-11-16 08:50:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 08:50:56,328 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:50:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:50:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:50:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2022-11-16 08:50:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2022-11-16 08:50:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 08:50:57,441 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:50:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:50:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 08:51:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 28 states and 51 transitions. [2022-11-16 08:51:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2022-11-16 08:51:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 08:51:07,954 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 08:51:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 29 states and 51 transitions. [2022-11-16 08:51:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. [2022-11-16 08:51:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 08:51:09,507 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:09,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 08:51:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 30 states and 53 transitions. [2022-11-16 08:51:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2022-11-16 08:51:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 08:51:11,306 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 08:51:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 26 states and 43 transitions. [2022-11-16 08:51:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. [2022-11-16 08:51:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 08:51:12,733 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:12,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:51:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 28 states and 46 transitions. [2022-11-16 08:51:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 46 transitions. [2022-11-16 08:51:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 08:51:18,775 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:51:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 24 states and 30 transitions. [2022-11-16 08:51:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-11-16 08:51:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 08:51:21,179 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:51:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2022-11-16 08:51:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-11-16 08:51:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 08:51:32,117 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:51:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 25 states and 32 transitions. [2022-11-16 08:51:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-11-16 08:51:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 08:51:34,800 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:34,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:51:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:51:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 32 states and 44 transitions. [2022-11-16 08:51:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-11-16 08:51:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 08:51:47,758 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:51:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:51:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:51:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 08:52:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:52:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 42 states and 60 transitions. [2022-11-16 08:52:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-11-16 08:52:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 08:52:07,362 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:52:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:52:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:52:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 08:52:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:52:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 55 states and 87 transitions. [2022-11-16 08:52:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 87 transitions. [2022-11-16 08:52:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 08:52:38,997 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:52:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:52:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:52:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 08:53:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:53:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 71 states and 132 transitions. [2022-11-16 08:53:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 132 transitions. [2022-11-16 08:53:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 08:53:05,687 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:53:05,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:53:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:53:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 08:53:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:53:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 72 states and 136 transitions. [2022-11-16 08:53:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 136 transitions. [2022-11-16 08:53:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 08:53:07,364 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:53:07,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:53:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:53:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 08:53:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:53:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 73 states and 139 transitions. [2022-11-16 08:53:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 139 transitions. [2022-11-16 08:53:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 08:53:09,058 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:53:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:53:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:53:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 08:53:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:53:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 74 states and 140 transitions. [2022-11-16 08:53:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 140 transitions. [2022-11-16 08:53:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 08:53:10,760 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:53:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:53:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:53:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 08:53:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:53:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 90 states and 167 transitions. [2022-11-16 08:53:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 167 transitions. [2022-11-16 08:53:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 08:53:38,624 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:53:38,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:53:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:53:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 08:53:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:53:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 92 states and 171 transitions. [2022-11-16 08:53:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2022-11-16 08:53:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 08:53:52,973 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:53:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:53:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:53:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 08:53:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:53:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 93 states and 173 transitions. [2022-11-16 08:53:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-11-16 08:53:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 08:53:54,744 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:53:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:53:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:53:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 7 proven. 70 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 08:54:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:54:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 96 states and 176 transitions. [2022-11-16 08:54:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2022-11-16 08:54:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 08:54:15,182 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:54:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:54:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:54:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 53 proven. 35 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-16 08:54:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:54:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 97 states and 177 transitions. [2022-11-16 08:54:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-11-16 08:54:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 08:54:16,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-16 08:54:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 08:54:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 08:54:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 69 proven. 35 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-16 08:54:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-16 08:54:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 53 states and 80 transitions. [2022-11-16 08:54:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-11-16 08:54:18,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 08:54:18,710 WARN L419 CodeCheckObserver]: This Program is SAFE, Check terminated with 34 iterations. [2022-11-16 08:54:18,718 INFO L754 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2022-11-16 08:54:21,623 INFO L560 CodeCheckObserver]: Invariant with dag size 122 [2022-11-16 08:54:21,651 INFO L560 CodeCheckObserver]: Invariant with dag size 119 [2022-11-16 08:54:21,674 INFO L560 CodeCheckObserver]: Invariant with dag size 14 [2022-11-16 08:54:21,675 INFO L560 CodeCheckObserver]: Invariant with dag size 96 [2022-11-16 08:54:21,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 16.11 08:54:21 ImpRootNode [2022-11-16 08:54:21,687 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-11-16 08:54:21,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 08:54:21,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 08:54:21,688 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 08:54:21,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:50:43" (3/4) ... [2022-11-16 08:54:21,692 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 08:54:21,701 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-16 08:54:21,701 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-16 08:54:21,702 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 08:54:21,702 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 08:54:21,750 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/witness.graphml [2022-11-16 08:54:21,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 08:54:21,752 INFO L158 Benchmark]: Toolchain (without parser) took 219426.12ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 79.8MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 228.0MB. Max. memory is 16.1GB. [2022-11-16 08:54:21,752 INFO L158 Benchmark]: CDTParser took 1.19ms. Allocated memory is still 117.4MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 08:54:21,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.60ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 91.7MB in the end (delta: -12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 08:54:21,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.20ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 90.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 08:54:21,754 INFO L158 Benchmark]: Boogie Preprocessor took 56.39ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 88.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 08:54:21,754 INFO L158 Benchmark]: RCFGBuilder took 553.22ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 74.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 08:54:21,755 INFO L158 Benchmark]: CodeCheck took 218228.09ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 74.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 864.1MB. Max. memory is 16.1GB. [2022-11-16 08:54:21,756 INFO L158 Benchmark]: Witness Printer took 63.20ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 08:54:21,758 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 215.2s, OverallIterations: 34, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1741 SdHoareTripleChecker+Valid, 50.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1268 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 43.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5511 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13761 IncrementalHoareTripleChecker+Invalid, 19272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5511 mSolverCounterUnsat, 132 mSDtfsCounter, 13761 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6552 GetRequests, 5404 SyntacticMatches, 404 SemanticMatches, 744 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302177 ImplicationChecksByTransitivity, 193.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 42.9s InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 12866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 2 PerfectInterpolantSequences, 715/1462 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: (((((((((((((((((unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1] && (max + 4294967295) / 4294967296 * 4294967296 + i + j + str2 == max + 4294967295 + str1) && 4294967291 + max <= (max + 4294967295) / 4294967296 * 4294967296 + i) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && 4294967296 <= (max + 4294967295) / 4294967296 * 4294967296 + i) && (max + 4294967295) / 4294967296 * 4294967296 + i <= 4294967291 + max) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && (max + 4294967295) / 4294967296 * 4294967296 + i <= 4294967296) && !(str2 == str1)) && str1 == 0) || (((((((!(((((j <= 1 && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][i + str1 + 1]) && 1 <= j) && str2 == 0) && !(str2 == str1)) && str1 == 0) && 0 < max / 4294967296 + 1) && !(((((((3 <= j && 1 <= i) && j <= 3) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && !(str2 == str1)) && i <= 1) && str1 == 0)) && i + 1 <= max) && i <= 4) && !(((((((unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3] && i <= 2) && 2 <= j) && str2 == 0) && 2 <= i) && !(str2 == str1)) && j <= 2) && str1 == 0)) && max <= i + 1) && !((((((unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1] && i == 0) && j <= 4) && str2 == 0) && !(str2 == str1)) && 4 <= j) && str1 == 0))) || ((((((((j <= 1 && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][i + str1 + 1]) && max <= 2 + i) && i <= 3) && 0 < max / 4294967296 + 1) && 1 <= j) && str2 == 0) && !(str2 == str1)) && str1 == 0)) || (((((((((max + 4294967295 == (max + 4294967295) / 4294967296 * 4294967296 + i + j && !(4294967299 <= (max + 4294967295) / 4294967296 * 4294967296 + i)) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && str2 == 0) && 4294967298 <= (max + 4294967295) / 4294967296 * 4294967296 + i) && !(str2 == str1)) && j <= 2) && (max + 4294967295) / 4294967296 * 4294967296 + i <= max + 4294967293) && str1 == 0)) || ((((((((((max + 4294967295 == (max + 4294967295) / 4294967296 * 4294967296 + i + j && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && 4294967292 + max <= (max + 4294967295) / 4294967296 * 4294967296 + i) && 4294967297 <= (max + 4294967295) / 4294967296 * 4294967296 + i) && (max + 4294967295) / 4294967296 * 4294967296 + i <= 4294967292 + max) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && !(str2 == str1)) && !(4294967298 <= (max + 4294967295) / 4294967296 * 4294967296 + i)) && str1 == 0)) || (((((((((((unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1] && i == 0) && j <= 4) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && 0 < max / 4294967296 + 1) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && !(str2 == str1)) && !(5 <= max)) && 4 <= j) && str1 == 0)) || (((((((((((!(i + 4 <= max) && 3 <= j) && 1 <= i) && unknown-#memory_int-unknown[str1][3 + i + str1] == unknown-#memory_int-unknown[str2][0]) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && 0 < max / 4294967296 + 1) && j <= 3) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && !(str2 == str1)) && i <= 1) && str1 == 0)) || ((((((((((unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3] && 0 < max / 4294967296 + 1) && i <= 2) && unknown-#memory_int-unknown[str1][2 + i + str1] == unknown-#memory_int-unknown[str2][0]) && !(3 + i <= max)) && 2 <= j) && str2 == 0) && 2 <= i) && !(str2 == str1)) && j <= 2) && str1 == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((i + str1 == 1 && i + 1 <= max) && str2 == 0) && !(str2 == str1)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && !((3 <= j && j <= 3) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2])) && max <= i + 1) && str1 == 0) || (((((((((((unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3] && 0 < max / 4294967296 + 1) && unknown-#memory_int-unknown[str1][2 + i + str1] == unknown-#memory_int-unknown[str2][0]) && !(3 + i <= max)) && 2 <= j) && str2 == 0) && i + str1 <= 2) && 2 <= i) && !(str2 == str1)) && j <= 2) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && str1 == 0)) || ((((!((((str2 == 0 && !(str2 == str1)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && str1 == 0) && j + str2 == 0) && 0 < max / 4294967296 + 1) && !((((str2 == 0 && !(str2 == str1)) && i + str1 <= 3) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && str1 == 0)) && i / 4294967296 <= 0) && max <= i)) || ((i == 0 && i <= max) && max <= i)) || (((((((0 < max / 4294967296 + 1 && str2 == 0) && !(str2 == str1)) && i + str1 <= 3) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && str1 == 0) && 2 < i + str1) && !(2 + i <= max))) || (((((((((((3 <= j && i + 4 <= max) && unknown-#memory_int-unknown[str1][3 + i + str1] == unknown-#memory_int-unknown[str2][0]) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && j <= 3) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && i + str1 == 1) && str2 == 0) && max <= i + 4) && !(str2 == str1)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && str1 == 0)) || (((((0 < max / 4294967296 + 1 && i + str1 <= 2) && 2 <= i) && !((unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3] && 2 <= j) && j <= 2)) && !(i + 1 <= max)) && str1 == 0)) || ((((((((((j <= 1 && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][i + str1 + 1]) && max <= 2 + i) && 1 <= j) && str2 == 0) && !(str2 == str1)) && i + str1 <= 3) && 2 + i <= max) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && str1 == 0) && 2 < i + str1)) || (((((((!((unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1] && j <= 4) && 4 <= j) && i == 0) && 0 < max / 4294967296 + 1) && str2 == 0) && !(str2 == str1)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && max <= i + 1) && str1 == 0)) || (((((((0 < max / 4294967296 + 1 && str2 == 0) && i <= 4) && !(str2 == str1)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && max <= i + 1) && str1 == 0) && j + str2 == 0)) || ((((((((((((unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1] && i == 0) && j <= 4) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && 0 < max / 4294967296 + 1) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && !(str2 == str1)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && !(5 <= max)) && 4 <= j) && str1 == 0)) || ((((0 < max / 4294967296 + 1 && !(i <= max)) && i + str1 == 1) && !((3 <= j && j <= 3) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2])) && str1 == 0)) || (((((((((((max <= 3 + i && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && unknown-#memory_int-unknown[str1][2 + i + str1] == unknown-#memory_int-unknown[str2][0]) && 2 <= j) && str2 == 0) && i + str1 <= 2) && 2 <= i) && !(str2 == str1)) && j <= 2) && 3 + i <= max) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && str1 == 0)) || (((((((((((!(i + 4 <= max) && 3 <= j) && unknown-#memory_int-unknown[str1][3 + i + str1] == unknown-#memory_int-unknown[str2][0]) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && 0 < max / 4294967296 + 1) && j <= 3) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && i + str1 == 1) && str2 == 0) && !(str2 == str1)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && str1 == 0)) || ((((((((i + 1 <= max && str2 == 0) && i + str1 <= 2) && 2 <= i) && !(str2 == str1)) && !((unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3] && 2 <= j) && j <= 2)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && max <= i + 1) && str1 == 0)) || ((((((((((((unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1] && max <= 5) && i == 0) && j <= 4) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && 5 <= max) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && !(str2 == str1)) && unknown-#memory_int-unknown[str1][i + str1] == unknown-#memory_int-unknown[str2][j + str2]) && 4 <= j) && str1 == 0)) || ((((i <= max && i + str1 == 1) && !((3 <= j && j <= 3) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2])) && str1 == 0) && max <= i) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((max <= 5 && 5 <= max) && str2 == 0) && !(str2 == str1)) && str1 == 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((((((((((unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1] && (max + 4294967295) / 4294967296 * 4294967296 + i + j + str2 == max + 4294967295 + str1) && 4294967291 + max <= (max + 4294967295) / 4294967296 * 4294967296 + i) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && 4294967296 <= (max + 4294967295) / 4294967296 * 4294967296 + i) && (max + 4294967295) / 4294967296 * 4294967296 + i <= 4294967291 + max) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && (max + 4294967295) / 4294967296 * 4294967296 + i <= 4294967296) && !(str2 == str1)) && str1 == 0) || (((((((((((unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1] && unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1] == unknown-#memory_int-unknown[str1][0]) && (max + 4294967295) / 4294967296 * 4294967296 <= 4294967291 + max) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && (max + 4294967295) / 4294967296 * 4294967296 + i <= 4294967295) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && !(str2 == str1)) && 4294967290 + max <= (max + 4294967295) / 4294967296 * 4294967296 + i) && 0 < (max + 4294967295) / 4294967296) && str1 == 0)) || (((((((((max + 4294967295 == (max + 4294967295) / 4294967296 * 4294967296 + i + j && !(4294967299 <= (max + 4294967295) / 4294967296 * 4294967296 + i)) && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && str2 == 0) && 4294967298 <= (max + 4294967295) / 4294967296 * 4294967296 + i) && !(str2 == str1)) && j <= 2) && (max + 4294967295) / 4294967296 * 4294967296 + i <= max + 4294967293) && str1 == 0)) || ((((((((((max + 4294967295 == (max + 4294967295) / 4294967296 * 4294967296 + i + j && unknown-#memory_int-unknown[str2][1] == unknown-#memory_int-unknown[str1][3]) && 4294967292 + max <= (max + 4294967295) / 4294967296 * 4294967296 + i) && 4294967297 <= (max + 4294967295) / 4294967296 * 4294967296 + i) && (max + 4294967295) / 4294967296 * 4294967296 + i <= 4294967292 + max) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && unknown-#memory_int-unknown[str1][2] == unknown-#memory_int-unknown[str2][2]) && str2 == 0) && !(str2 == str1)) && !(4294967298 <= (max + 4294967295) / 4294967296 * 4294967296 + i)) && str1 == 0)) || ((((((max <= 5 && 5 <= max) && str2 == 0) && (max + 4294967295) / 4294967296 * 4294967296 + i == max + 4294967295) && !(str2 == str1)) && j == 0) && str1 == 0)) || (((((((((max + 4294967295) / 4294967296 * 4294967296 + i <= max + 4294967294 && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][4 + str1]) && str2 == 0) && (max + 4294967295) / 4294967296 * 4294967296 + i <= 4294967299) && !(str2 == str1)) && j + str2 == 1) && str1 == 0) && 4294967299 <= (max + 4294967295) / 4294967296 * 4294967296 + i) && max + 4294967294 <= (max + 4294967295) / 4294967296 * 4294967296 + i) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.19ms. Allocated memory is still 117.4MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.60ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 91.7MB in the end (delta: -12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.20ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 90.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.39ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 88.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.22ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 74.9MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * CodeCheck took 218228.09ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 74.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 864.1MB. Max. memory is 16.1GB. * Witness Printer took 63.20ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2022-11-16 08:54:21,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d20348f-90f0-4a61-a110-251947be56c7/bin/ukojak-CydTVMUXoH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE