./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sumt9.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/sumt9.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 764253d17e173cc8ef429b98791fc330017ac102 ................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/sumt9.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 764253d17e173cc8ef429b98791fc330017ac102 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@594f9b59 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:14:46,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:14:46,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:14:46,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:14:46,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:14:46,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:14:46,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:14:46,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:14:46,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:14:46,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:14:46,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:14:46,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:14:46,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:14:46,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:14:46,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:14:46,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:14:46,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:14:46,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:14:46,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:14:46,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:14:46,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:14:46,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:14:46,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:14:46,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:14:46,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:14:46,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:14:46,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:14:46,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:14:46,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:14:46,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:14:46,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:14:46,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:14:46,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:14:46,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:14:46,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:14:46,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:14:46,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:14:46,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:14:46,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:14:46,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:14:46,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:14:46,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:14:46,218 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:14:46,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:14:46,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:14:46,219 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:14:46,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:14:46,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:14:46,220 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:14:46,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:14:46,222 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:14:46,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:14:46,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:14:46,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:14:46,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:14:46,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:14:46,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:14:46,229 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:14:46,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:14:46,230 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:14:46,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:14:46,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:14:46,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:14:46,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:14:46,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:46,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:14:46,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:14:46,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:14:46,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:14:46,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:14:46,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:14:46,231 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:14:46,231 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 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 -> 764253d17e173cc8ef429b98791fc330017ac102 [2021-09-13 14:14:46,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:14:46,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:14:46,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:14:46,560 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:14:46,561 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:14:46,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt9.c [2021-09-13 14:14:46,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c7fbe6f/af7bd5f24454484ea2f89fd71e1cf612/FLAG32cbbfe96 [2021-09-13 14:14:47,122 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:14:47,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt9.c [2021-09-13 14:14:47,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c7fbe6f/af7bd5f24454484ea2f89fd71e1cf612/FLAG32cbbfe96 [2021-09-13 14:14:47,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c7fbe6f/af7bd5f24454484ea2f89fd71e1cf612 [2021-09-13 14:14:47,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:14:47,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:14:47,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:47,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:14:47,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:14:47,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5710ea05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47, skipping insertion in model container [2021-09-13 14:14:47,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:14:47,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:14:47,760 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt9.c[403,416] [2021-09-13 14:14:47,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:47,791 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:14:47,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt9.c[403,416] [2021-09-13 14:14:47,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:47,830 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:14:47,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47 WrapperNode [2021-09-13 14:14:47,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:47,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:47,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:14:47,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:14:47,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:47,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:14:47,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:14:47,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:14:47,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:14:47,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:14:47,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:14:47,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:14:47,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (1/1) ... [2021-09-13 14:14:47,947 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:47,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:47,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:14:47,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:14:48,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:14:48,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:14:48,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:14:48,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:14:48,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:14:48,296 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:14:48,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:48 BoogieIcfgContainer [2021-09-13 14:14:48,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:14:48,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:14:48,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:14:48,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:14:48,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:14:47" (1/3) ... [2021-09-13 14:14:48,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f4667a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:48, skipping insertion in model container [2021-09-13 14:14:48,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:47" (2/3) ... [2021-09-13 14:14:48,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f4667a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:48, skipping insertion in model container [2021-09-13 14:14:48,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:48" (3/3) ... [2021-09-13 14:14:48,320 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt9.c [2021-09-13 14:14:48,324 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:14:48,325 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:14:48,401 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:14:48,411 INFO L339 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, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:14:48,412 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:14:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-09-13 14:14:48,438 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:48,439 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:48,440 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash 183357013, now seen corresponding path program 1 times [2021-09-13 14:14:48,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:48,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948118187] [2021-09-13 14:14:48,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:48,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:48,923 INFO L281 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {23#true} is VALID [2021-09-13 14:14:48,925 INFO L281 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v1~0 := 0;main_~v2~0 := 0;main_~v3~0 := 0;main_~v4~0 := 0;main_~v5~0 := 0;main_~v6~0 := 0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {25#(and (= ULTIMATE.start_main_~v6~0 0) (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~v5~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:48,926 INFO L281 TraceCheckUtils]: 2: Hoare triple {25#(and (= ULTIMATE.start_main_~v6~0 0) (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~v5~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {25#(and (= ULTIMATE.start_main_~v6~0 0) (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~v5~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:48,927 INFO L281 TraceCheckUtils]: 3: Hoare triple {25#(and (= ULTIMATE.start_main_~v6~0 0) (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~v5~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {25#(and (= ULTIMATE.start_main_~v6~0 0) (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~v5~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:48,928 INFO L281 TraceCheckUtils]: 4: Hoare triple {25#(and (= ULTIMATE.start_main_~v6~0 0) (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~v5~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 9 then main_~l~0 % 4294967296 % 9 - 9 else main_~l~0 % 4294967296 % 9) % 4294967296;main_~v6~0 := 1 + main_~v6~0; {26#(and (<= 1 ULTIMATE.start_main_~v6~0) (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~v5~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0) (<= ULTIMATE.start_main_~v6~0 1))} is VALID [2021-09-13 14:14:48,930 INFO L281 TraceCheckUtils]: 5: Hoare triple {26#(and (<= 1 ULTIMATE.start_main_~v6~0) (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~v5~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0) (<= ULTIMATE.start_main_~v6~0 1))} main_~l~0 := 1 + main_~l~0;__VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v1~0 + main_~v2~0 + main_~v3~0 + main_~v4~0 + main_~v5~0 + main_~v6~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {27#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:14:48,930 INFO L281 TraceCheckUtils]: 6: Hoare triple {27#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {24#false} is VALID [2021-09-13 14:14:48,930 INFO L281 TraceCheckUtils]: 7: Hoare triple {24#false} assume !false; {24#false} is VALID [2021-09-13 14:14:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:48,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:48,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948118187] [2021-09-13 14:14:48,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948118187] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:48,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:48,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:14:48,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045027267] [2021-09-13 14:14:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-09-13 14:14:48,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:48,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:48,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:48,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:48,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:48,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:48,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:14:48,987 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:51,093 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:53,401 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:55,643 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:57,838 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:00,059 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:02,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:02,489 INFO L93 Difference]: Finished difference Result 46 states and 70 transitions. [2021-09-13 14:15:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:15:02,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-09-13 14:15:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2021-09-13 14:15:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2021-09-13 14:15:02,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2021-09-13 14:15:02,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:02,585 INFO L225 Difference]: With dead ends: 46 [2021-09-13 14:15:02,585 INFO L226 Difference]: Without dead ends: 21 [2021-09-13 14:15:02,587 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.77ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:15:02,590 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12208.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13095.64ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:02,591 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 115 Unknown, 0 Unchecked, 4.08ms Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 13095.64ms Time] [2021-09-13 14:15:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-09-13 14:15:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-09-13 14:15:02,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:02,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:02,647 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:02,647 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:02,650 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2021-09-13 14:15:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2021-09-13 14:15:02,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:02,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:02,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2021-09-13 14:15:02,663 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2021-09-13 14:15:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:02,665 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2021-09-13 14:15:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2021-09-13 14:15:02,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:02,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:02,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:02,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-09-13 14:15:02,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 8 [2021-09-13 14:15:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:02,669 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-09-13 14:15:02,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2021-09-13 14:15:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-13 14:15:02,669 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:02,669 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:02,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:15:02,670 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1389931373, now seen corresponding path program 1 times [2021-09-13 14:15:02,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:15:02,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849819424] [2021-09-13 14:15:02,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:02,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:15:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:03,042 INFO L281 TraceCheckUtils]: 0: Hoare triple {146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {148#(and (<= ~SIZE~0 20000001) (< 0 (+ (div ~SIZE~0 4294967296) 1)))} is VALID [2021-09-13 14:15:03,043 INFO L281 TraceCheckUtils]: 1: Hoare triple {148#(and (<= ~SIZE~0 20000001) (< 0 (+ (div ~SIZE~0 4294967296) 1)))} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v1~0 := 0;main_~v2~0 := 0;main_~v3~0 := 0;main_~v4~0 := 0;main_~v5~0 := 0;main_~v6~0 := 0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {149#(and (<= (div ~SIZE~0 4294967296) (div ULTIMATE.start_main_~l~0 4294967296)) (= ULTIMATE.start_main_~l~0 0))} is VALID [2021-09-13 14:15:03,043 INFO L281 TraceCheckUtils]: 2: Hoare triple {149#(and (<= (div ~SIZE~0 4294967296) (div ULTIMATE.start_main_~l~0 4294967296)) (= ULTIMATE.start_main_~l~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {150#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:15:03,044 INFO L281 TraceCheckUtils]: 3: Hoare triple {150#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {150#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:15:03,044 INFO L281 TraceCheckUtils]: 4: Hoare triple {150#(= ULTIMATE.start_main_~l~0 0)} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 9 then main_~l~0 % 4294967296 % 9 - 9 else main_~l~0 % 4294967296 % 9) % 4294967296); {147#false} is VALID [2021-09-13 14:15:03,045 INFO L281 TraceCheckUtils]: 5: Hoare triple {147#false} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 8 then main_~l~0 % 4294967296 % 8 - 8 else main_~l~0 % 4294967296 % 8) % 4294967296;main_~v5~0 := 1 + main_~v5~0; {147#false} is VALID [2021-09-13 14:15:03,045 INFO L281 TraceCheckUtils]: 6: Hoare triple {147#false} main_~l~0 := 1 + main_~l~0;__VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v1~0 + main_~v2~0 + main_~v3~0 + main_~v4~0 + main_~v5~0 + main_~v6~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {147#false} is VALID [2021-09-13 14:15:03,045 INFO L281 TraceCheckUtils]: 7: Hoare triple {147#false} assume 0 == __VERIFIER_assert_~cond; {147#false} is VALID [2021-09-13 14:15:03,045 INFO L281 TraceCheckUtils]: 8: Hoare triple {147#false} assume !false; {147#false} is VALID [2021-09-13 14:15:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:03,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:15:03,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849819424] [2021-09-13 14:15:03,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849819424] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:15:03,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:15:03,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:15:03,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112870481] [2021-09-13 14:15:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-09-13 14:15:03,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:15:03,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:05,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 8 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:05,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:15:05,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:15:05,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:15:05,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:15:05,210 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:07,331 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:15:07,483 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.33ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:15:07,484 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2049.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2049.84ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:07,484 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.60ms Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2049.84ms Time] [2021-09-13 14:15:07,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 14:15:07,485 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@6ef91c03 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.reviewInductiveInternal(ChainingHoareTripleChecker.java:318) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:290) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:863) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:779) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-09-13 14:15:07,488 INFO L158 Benchmark]: Toolchain (without parser) took 19874.43ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 42.7MB in the beginning and 31.8MB in the end (delta: 11.0MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2021-09-13 14:15:07,488 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 44.4MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:15:07,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.33ms. Allocated memory is still 62.9MB. Free memory was 42.6MB in the beginning and 32.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:15:07,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.61ms. Allocated memory is still 62.9MB. Free memory was 32.0MB in the beginning and 45.0MB in the end (delta: -13.0MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2021-09-13 14:15:07,489 INFO L158 Benchmark]: Boogie Preprocessor took 26.35ms. Allocated memory is still 62.9MB. Free memory was 45.0MB in the beginning and 43.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:15:07,489 INFO L158 Benchmark]: RCFGBuilder took 374.78ms. Allocated memory is still 62.9MB. Free memory was 43.7MB in the beginning and 33.0MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:15:07,490 INFO L158 Benchmark]: TraceAbstraction took 19172.62ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 32.5MB in the beginning and 31.8MB in the end (delta: 740.3kB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2021-09-13 14:15:07,491 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 44.4MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.33ms. Allocated memory is still 62.9MB. Free memory was 42.6MB in the beginning and 32.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.61ms. Allocated memory is still 62.9MB. Free memory was 32.0MB in the beginning and 45.0MB in the end (delta: -13.0MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.35ms. Allocated memory is still 62.9MB. Free memory was 45.0MB in the beginning and 43.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 374.78ms. Allocated memory is still 62.9MB. Free memory was 43.7MB in the beginning and 33.0MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19172.62ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 32.5MB in the beginning and 31.8MB in the end (delta: 740.3kB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@6ef91c03 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@6ef91c03: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-09-13 14:15:07,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:15:09,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:15:09,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:15:09,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:15:09,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:15:09,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:15:09,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:15:09,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:15:09,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:15:09,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:15:09,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:15:09,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:15:09,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:15:09,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:15:09,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:15:09,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:15:09,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:15:09,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:15:09,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:15:09,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:15:09,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:15:09,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:15:09,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:15:09,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:15:09,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:15:09,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:15:09,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:15:09,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:15:09,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:15:09,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:15:09,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:15:09,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:15:09,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:15:09,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:15:09,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:15:09,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:15:09,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:15:09,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:15:09,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:15:09,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:15:09,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:15:09,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-09-13 14:15:09,365 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:15:09,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:15:09,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:15:09,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:15:09,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:15:09,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:15:09,368 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:15:09,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:15:09,368 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:15:09,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:15:09,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:15:09,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:15:09,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:15:09,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:15:09,370 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:15:09,370 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:15:09,370 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:15:09,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:15:09,376 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:15:09,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:15:09,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:15:09,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:15:09,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:15:09,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:15:09,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:15:09,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:15:09,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:15:09,377 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:15:09,377 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:15:09,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:15:09,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:15:09,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:15:09,378 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 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 -> 764253d17e173cc8ef429b98791fc330017ac102 [2021-09-13 14:15:09,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:15:09,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:15:09,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:15:09,674 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:15:09,675 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:15:09,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt9.c [2021-09-13 14:15:09,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67a102e62/e62383f1d4ea4fbd9d191eefc2dabb7a/FLAG10167442b [2021-09-13 14:15:10,116 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:15:10,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt9.c [2021-09-13 14:15:10,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67a102e62/e62383f1d4ea4fbd9d191eefc2dabb7a/FLAG10167442b [2021-09-13 14:15:10,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67a102e62/e62383f1d4ea4fbd9d191eefc2dabb7a [2021-09-13 14:15:10,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:15:10,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:15:10,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:15:10,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:15:10,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:15:10,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a1c162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10, skipping insertion in model container [2021-09-13 14:15:10,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:15:10,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:15:10,318 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt9.c[403,416] [2021-09-13 14:15:10,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:15:10,358 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:15:10,398 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt9.c[403,416] [2021-09-13 14:15:10,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:15:10,425 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:15:10,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10 WrapperNode [2021-09-13 14:15:10,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:15:10,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:15:10,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:15:10,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:15:10,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:15:10,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:15:10,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:15:10,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:15:10,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:15:10,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:15:10,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:15:10,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:15:10,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (1/1) ... [2021-09-13 14:15:10,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:15:10,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:15:10,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:15:10,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:15:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:15:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:15:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:15:10,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:15:10,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:15:10,737 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:15:10,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:15:10 BoogieIcfgContainer [2021-09-13 14:15:10,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:15:10,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:15:10,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:15:10,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:15:10,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:15:10" (1/3) ... [2021-09-13 14:15:10,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7ecae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:15:10, skipping insertion in model container [2021-09-13 14:15:10,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:15:10" (2/3) ... [2021-09-13 14:15:10,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7ecae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:15:10, skipping insertion in model container [2021-09-13 14:15:10,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:15:10" (3/3) ... [2021-09-13 14:15:10,744 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt9.c [2021-09-13 14:15:10,747 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:15:10,747 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:15:10,784 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:15:10,790 INFO L339 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, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:15:10,790 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:15:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-09-13 14:15:10,805 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:10,805 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:10,805 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash 183357013, now seen corresponding path program 1 times [2021-09-13 14:15:10,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:10,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534309915] [2021-09-13 14:15:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:10,818 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:10,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:15:10,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 14:15:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:10,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:15:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:10,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:11,575 INFO L281 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {23#true} is VALID [2021-09-13 14:15:11,577 INFO L281 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {31#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:11,577 INFO L281 TraceCheckUtils]: 2: Hoare triple {31#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {31#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:11,580 INFO L281 TraceCheckUtils]: 3: Hoare triple {31#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {31#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:11,581 INFO L281 TraceCheckUtils]: 4: Hoare triple {31#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {41#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:11,582 INFO L281 TraceCheckUtils]: 5: Hoare triple {41#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {45#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:15:11,583 INFO L281 TraceCheckUtils]: 6: Hoare triple {45#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {24#false} is VALID [2021-09-13 14:15:11,583 INFO L281 TraceCheckUtils]: 7: Hoare triple {24#false} assume !false; {24#false} is VALID [2021-09-13 14:15:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:11,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:19,903 INFO L281 TraceCheckUtils]: 7: Hoare triple {24#false} assume !false; {24#false} is VALID [2021-09-13 14:15:19,903 INFO L281 TraceCheckUtils]: 6: Hoare triple {55#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {24#false} is VALID [2021-09-13 14:15:19,915 INFO L281 TraceCheckUtils]: 5: Hoare triple {59#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {55#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:15:21,922 INFO L281 TraceCheckUtils]: 4: Hoare triple {63#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {59#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} is UNKNOWN [2021-09-13 14:15:21,923 INFO L281 TraceCheckUtils]: 3: Hoare triple {63#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {63#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:15:21,923 INFO L281 TraceCheckUtils]: 2: Hoare triple {63#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {63#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:15:21,924 INFO L281 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {63#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:15:21,924 INFO L281 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {23#true} is VALID [2021-09-13 14:15:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:21,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:15:21,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534309915] [2021-09-13 14:15:21,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534309915] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:15:21,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:15:21,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-09-13 14:15:21,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137128932] [2021-09-13 14:15:21,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-09-13 14:15:21,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:15:21,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:23,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 13 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:23,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:15:23,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:15:24,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:15:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:15:24,009 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:27,216 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:29,559 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:32,193 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:34,749 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:37,442 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:39,689 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:42,375 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:44,426 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:45,050 INFO L93 Difference]: Finished difference Result 60 states and 93 transitions. [2021-09-13 14:15:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:15:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-09-13 14:15:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2021-09-13 14:15:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2021-09-13 14:15:45,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2021-09-13 14:15:47,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 92 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:47,600 INFO L225 Difference]: With dead ends: 60 [2021-09-13 14:15:47,600 INFO L226 Difference]: Without dead ends: 31 [2021-09-13 14:15:47,601 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 379.82ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:15:47,603 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 14 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17966.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.48ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18000.51ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:47,604 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 6.48ms Time], IncrementalHoareTripleChecker [14 Valid, 162 Invalid, 8 Unknown, 0 Unchecked, 18000.51ms Time] [2021-09-13 14:15:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-09-13 14:15:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2021-09-13 14:15:47,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:47,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:47,634 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:47,635 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:47,637 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. [2021-09-13 14:15:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2021-09-13 14:15:47,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:47,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:47,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2021-09-13 14:15:47,639 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2021-09-13 14:15:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:47,640 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. [2021-09-13 14:15:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2021-09-13 14:15:47,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:47,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:47,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:47,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-09-13 14:15:47,643 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 8 [2021-09-13 14:15:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:47,644 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-09-13 14:15:47,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2021-09-13 14:15:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:15:47,644 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:47,645 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:47,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-09-13 14:15:47,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:15:47,854 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:47,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1844577864, now seen corresponding path program 1 times [2021-09-13 14:15:47,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:47,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471568101] [2021-09-13 14:15:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:47,856 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:47,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:47,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:15:47,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-09-13 14:15:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:47,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:15:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:47,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:48,041 INFO L281 TraceCheckUtils]: 0: Hoare triple {234#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {234#true} is VALID [2021-09-13 14:15:48,042 INFO L281 TraceCheckUtils]: 1: Hoare triple {234#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {242#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:48,042 INFO L281 TraceCheckUtils]: 2: Hoare triple {242#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvule32(main_~n~0, ~SIZE~0); {242#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:48,043 INFO L281 TraceCheckUtils]: 3: Hoare triple {242#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvult32(main_~l~0, main_~n~0); {242#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:48,044 INFO L281 TraceCheckUtils]: 4: Hoare triple {242#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {242#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:48,045 INFO L281 TraceCheckUtils]: 5: Hoare triple {242#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {255#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:48,046 INFO L281 TraceCheckUtils]: 6: Hoare triple {255#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == __VERIFIER_assert_~cond); {255#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:48,047 INFO L281 TraceCheckUtils]: 7: Hoare triple {255#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !!~bvult32(main_~l~0, main_~n~0); {255#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:48,047 INFO L281 TraceCheckUtils]: 8: Hoare triple {255#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {255#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:48,048 INFO L281 TraceCheckUtils]: 9: Hoare triple {255#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume 0bv32 == ~bvurem32(main_~l~0, 8bv32);main_~v5~0 := ~bvadd32(1bv32, main_~v5~0); {235#false} is VALID [2021-09-13 14:15:48,048 INFO L281 TraceCheckUtils]: 10: Hoare triple {235#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {235#false} is VALID [2021-09-13 14:15:48,048 INFO L281 TraceCheckUtils]: 11: Hoare triple {235#false} assume 0bv32 == __VERIFIER_assert_~cond; {235#false} is VALID [2021-09-13 14:15:48,049 INFO L281 TraceCheckUtils]: 12: Hoare triple {235#false} assume !false; {235#false} is VALID [2021-09-13 14:15:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:48,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:48,145 INFO L281 TraceCheckUtils]: 12: Hoare triple {235#false} assume !false; {235#false} is VALID [2021-09-13 14:15:48,146 INFO L281 TraceCheckUtils]: 11: Hoare triple {235#false} assume 0bv32 == __VERIFIER_assert_~cond; {235#false} is VALID [2021-09-13 14:15:48,146 INFO L281 TraceCheckUtils]: 10: Hoare triple {235#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {235#false} is VALID [2021-09-13 14:15:48,146 INFO L281 TraceCheckUtils]: 9: Hoare triple {286#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv8 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 8bv32);main_~v5~0 := ~bvadd32(1bv32, main_~v5~0); {235#false} is VALID [2021-09-13 14:15:48,147 INFO L281 TraceCheckUtils]: 8: Hoare triple {286#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv8 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {286#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:48,150 INFO L281 TraceCheckUtils]: 7: Hoare triple {286#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv8 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {286#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:48,151 INFO L281 TraceCheckUtils]: 6: Hoare triple {286#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv8 32)) (_ bv0 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {286#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:48,155 INFO L281 TraceCheckUtils]: 5: Hoare triple {299#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv8 32))))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {286#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:48,157 INFO L281 TraceCheckUtils]: 4: Hoare triple {299#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv8 32))))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {299#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv8 32))))} is VALID [2021-09-13 14:15:48,157 INFO L281 TraceCheckUtils]: 3: Hoare triple {299#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv8 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {299#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv8 32))))} is VALID [2021-09-13 14:15:48,158 INFO L281 TraceCheckUtils]: 2: Hoare triple {299#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv8 32))))} assume !!~bvule32(main_~n~0, ~SIZE~0); {299#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv8 32))))} is VALID [2021-09-13 14:15:48,159 INFO L281 TraceCheckUtils]: 1: Hoare triple {234#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {299#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv8 32))))} is VALID [2021-09-13 14:15:48,159 INFO L281 TraceCheckUtils]: 0: Hoare triple {234#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {234#true} is VALID [2021-09-13 14:15:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:48,160 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:15:48,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471568101] [2021-09-13 14:15:48,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471568101] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:15:48,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:15:48,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-09-13 14:15:48,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064652707] [2021-09-13 14:15:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-09-13 14:15:48,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:15:48,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:48,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:48,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:15:48,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:15:48,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:15:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:15:48,254 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:49,865 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2021-09-13 14:15:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:15:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-09-13 14:15:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2021-09-13 14:15:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2021-09-13 14:15:49,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 98 transitions. [2021-09-13 14:15:50,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:50,445 INFO L225 Difference]: With dead ends: 68 [2021-09-13 14:15:50,445 INFO L226 Difference]: Without dead ends: 51 [2021-09-13 14:15:50,445 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.77ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:15:50,446 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 749.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.22ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 752.03ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:50,447 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 3.22ms Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 752.03ms Time] [2021-09-13 14:15:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-09-13 14:15:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-09-13 14:15:50,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:50,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:50,461 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:50,462 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:50,464 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2021-09-13 14:15:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2021-09-13 14:15:50,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:50,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:50,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2021-09-13 14:15:50,465 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2021-09-13 14:15:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:50,467 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2021-09-13 14:15:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2021-09-13 14:15:50,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:50,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:50,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:50,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2021-09-13 14:15:50,470 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 13 [2021-09-13 14:15:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:50,470 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2021-09-13 14:15:50,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2021-09-13 14:15:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:15:50,471 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:50,471 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:50,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-09-13 14:15:50,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:15:50,681 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:50,682 INFO L82 PathProgramCache]: Analyzing trace with hash -278498073, now seen corresponding path program 1 times [2021-09-13 14:15:50,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:50,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361516887] [2021-09-13 14:15:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:50,682 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:50,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:50,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:15:50,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-09-13 14:15:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:50,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2021-09-13 14:15:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:50,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:52,053 INFO L281 TraceCheckUtils]: 0: Hoare triple {543#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {543#true} is VALID [2021-09-13 14:15:52,054 INFO L281 TraceCheckUtils]: 1: Hoare triple {543#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {551#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:52,054 INFO L281 TraceCheckUtils]: 2: Hoare triple {551#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {551#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:52,055 INFO L281 TraceCheckUtils]: 3: Hoare triple {551#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {551#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:52,056 INFO L281 TraceCheckUtils]: 4: Hoare triple {551#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {561#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,057 INFO L281 TraceCheckUtils]: 5: Hoare triple {561#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,062 INFO L281 TraceCheckUtils]: 6: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,062 INFO L281 TraceCheckUtils]: 7: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,063 INFO L281 TraceCheckUtils]: 8: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,063 INFO L281 TraceCheckUtils]: 9: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,064 INFO L281 TraceCheckUtils]: 10: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,064 INFO L281 TraceCheckUtils]: 11: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,065 INFO L281 TraceCheckUtils]: 12: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,066 INFO L281 TraceCheckUtils]: 13: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,066 INFO L281 TraceCheckUtils]: 14: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,067 INFO L281 TraceCheckUtils]: 15: Hoare triple {565#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {596#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:52,067 INFO L281 TraceCheckUtils]: 16: Hoare triple {596#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {600#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:15:52,068 INFO L281 TraceCheckUtils]: 17: Hoare triple {600#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {544#false} is VALID [2021-09-13 14:15:52,068 INFO L281 TraceCheckUtils]: 18: Hoare triple {544#false} assume !false; {544#false} is VALID [2021-09-13 14:15:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:52,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:58,814 INFO L281 TraceCheckUtils]: 18: Hoare triple {544#false} assume !false; {544#false} is VALID [2021-09-13 14:15:58,814 INFO L281 TraceCheckUtils]: 17: Hoare triple {610#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {544#false} is VALID [2021-09-13 14:15:58,827 INFO L281 TraceCheckUtils]: 16: Hoare triple {614#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {610#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:16:00,831 INFO L281 TraceCheckUtils]: 15: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {614#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} is UNKNOWN [2021-09-13 14:16:00,832 INFO L281 TraceCheckUtils]: 14: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,833 INFO L281 TraceCheckUtils]: 13: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,833 INFO L281 TraceCheckUtils]: 12: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,834 INFO L281 TraceCheckUtils]: 11: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,834 INFO L281 TraceCheckUtils]: 10: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,834 INFO L281 TraceCheckUtils]: 9: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,835 INFO L281 TraceCheckUtils]: 8: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,835 INFO L281 TraceCheckUtils]: 7: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,836 INFO L281 TraceCheckUtils]: 6: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:00,853 INFO L281 TraceCheckUtils]: 5: Hoare triple {614#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:02,861 INFO L281 TraceCheckUtils]: 4: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {614#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} is UNKNOWN [2021-09-13 14:16:02,862 INFO L281 TraceCheckUtils]: 3: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:02,863 INFO L281 TraceCheckUtils]: 2: Hoare triple {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:02,863 INFO L281 TraceCheckUtils]: 1: Hoare triple {543#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {618#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:02,863 INFO L281 TraceCheckUtils]: 0: Hoare triple {543#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {543#true} is VALID [2021-09-13 14:16:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:16:02,864 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:16:02,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361516887] [2021-09-13 14:16:02,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361516887] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:16:02,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:16:02,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2021-09-13 14:16:02,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773956261] [2021-09-13 14:16:02,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:16:02,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:02,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:07,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:07,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:16:07,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:16:07,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:16:07,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:16:07,133 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:10,928 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:13,603 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:16,206 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:18,752 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:21,238 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:23,823 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:26,205 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:26,848 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2021-09-13 14:16:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:16:26,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:16:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2021-09-13 14:16:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2021-09-13 14:16:26,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2021-09-13 14:16:31,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 58 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:31,382 INFO L225 Difference]: With dead ends: 65 [2021-09-13 14:16:31,383 INFO L226 Difference]: Without dead ends: 63 [2021-09-13 14:16:31,383 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 730.97ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:16:31,384 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 23 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16417.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.43ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16442.55ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:31,384 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 180 Unknown, 0 Unchecked, 4.43ms Time], IncrementalHoareTripleChecker [23 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 16442.55ms Time] [2021-09-13 14:16:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-09-13 14:16:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2021-09-13 14:16:31,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:31,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:31,409 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:31,409 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:31,412 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2021-09-13 14:16:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2021-09-13 14:16:31,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:31,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:31,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 63 states. [2021-09-13 14:16:31,413 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 63 states. [2021-09-13 14:16:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:31,415 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2021-09-13 14:16:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2021-09-13 14:16:31,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:31,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:31,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:31,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2021-09-13 14:16:31,419 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 19 [2021-09-13 14:16:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:31,419 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2021-09-13 14:16:31,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2021-09-13 14:16:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-13 14:16:31,420 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:31,420 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:31,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:16:31,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:16:31,634 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:31,634 INFO L82 PathProgramCache]: Analyzing trace with hash -806214825, now seen corresponding path program 1 times [2021-09-13 14:16:31,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:16:31,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324783009] [2021-09-13 14:16:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:31,635 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:16:31,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:16:31,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:16:31,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-09-13 14:16:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:31,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 14:16:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:31,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:31,952 INFO L281 TraceCheckUtils]: 0: Hoare triple {937#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {937#true} is VALID [2021-09-13 14:16:31,953 INFO L281 TraceCheckUtils]: 1: Hoare triple {937#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {945#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:16:31,953 INFO L281 TraceCheckUtils]: 2: Hoare triple {945#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvule32(main_~n~0, ~SIZE~0); {945#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:16:31,954 INFO L281 TraceCheckUtils]: 3: Hoare triple {945#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvult32(main_~l~0, main_~n~0); {945#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:16:31,954 INFO L281 TraceCheckUtils]: 4: Hoare triple {945#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {945#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:16:31,955 INFO L281 TraceCheckUtils]: 5: Hoare triple {945#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,955 INFO L281 TraceCheckUtils]: 6: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == __VERIFIER_assert_~cond); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,956 INFO L281 TraceCheckUtils]: 7: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !!~bvult32(main_~l~0, main_~n~0); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,956 INFO L281 TraceCheckUtils]: 8: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,957 INFO L281 TraceCheckUtils]: 9: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,957 INFO L281 TraceCheckUtils]: 10: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,958 INFO L281 TraceCheckUtils]: 11: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,958 INFO L281 TraceCheckUtils]: 12: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,959 INFO L281 TraceCheckUtils]: 13: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,959 INFO L281 TraceCheckUtils]: 14: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,959 INFO L281 TraceCheckUtils]: 15: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:31,960 INFO L281 TraceCheckUtils]: 16: Hoare triple {958#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:31,961 INFO L281 TraceCheckUtils]: 17: Hoare triple {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:31,961 INFO L281 TraceCheckUtils]: 18: Hoare triple {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:31,962 INFO L281 TraceCheckUtils]: 19: Hoare triple {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:31,962 INFO L281 TraceCheckUtils]: 20: Hoare triple {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:31,963 INFO L281 TraceCheckUtils]: 21: Hoare triple {992#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 7bv32);main_~v1~0 := ~bvadd32(1bv32, main_~v1~0); {938#false} is VALID [2021-09-13 14:16:31,963 INFO L281 TraceCheckUtils]: 22: Hoare triple {938#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {938#false} is VALID [2021-09-13 14:16:31,963 INFO L281 TraceCheckUtils]: 23: Hoare triple {938#false} assume 0bv32 == __VERIFIER_assert_~cond; {938#false} is VALID [2021-09-13 14:16:31,963 INFO L281 TraceCheckUtils]: 24: Hoare triple {938#false} assume !false; {938#false} is VALID [2021-09-13 14:16:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:31,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:33,633 INFO L281 TraceCheckUtils]: 24: Hoare triple {938#false} assume !false; {938#false} is VALID [2021-09-13 14:16:33,634 INFO L281 TraceCheckUtils]: 23: Hoare triple {938#false} assume 0bv32 == __VERIFIER_assert_~cond; {938#false} is VALID [2021-09-13 14:16:33,634 INFO L281 TraceCheckUtils]: 22: Hoare triple {938#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {938#false} is VALID [2021-09-13 14:16:33,634 INFO L281 TraceCheckUtils]: 21: Hoare triple {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 7bv32);main_~v1~0 := ~bvadd32(1bv32, main_~v1~0); {938#false} is VALID [2021-09-13 14:16:33,635 INFO L281 TraceCheckUtils]: 20: Hoare triple {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,635 INFO L281 TraceCheckUtils]: 19: Hoare triple {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,636 INFO L281 TraceCheckUtils]: 18: Hoare triple {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,636 INFO L281 TraceCheckUtils]: 17: Hoare triple {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,637 INFO L281 TraceCheckUtils]: 16: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1026#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,637 INFO L281 TraceCheckUtils]: 15: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,638 INFO L281 TraceCheckUtils]: 14: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,638 INFO L281 TraceCheckUtils]: 13: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,639 INFO L281 TraceCheckUtils]: 12: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,639 INFO L281 TraceCheckUtils]: 11: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,646 INFO L281 TraceCheckUtils]: 10: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,646 INFO L281 TraceCheckUtils]: 9: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,647 INFO L281 TraceCheckUtils]: 8: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,647 INFO L281 TraceCheckUtils]: 7: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:33,648 INFO L281 TraceCheckUtils]: 6: Hoare triple {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:35,658 INFO L281 TraceCheckUtils]: 5: Hoare triple {1076#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv7 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1042#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv7 32)) (_ bv0 32)))} is UNKNOWN [2021-09-13 14:16:35,659 INFO L281 TraceCheckUtils]: 4: Hoare triple {1076#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv7 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {1076#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:35,659 INFO L281 TraceCheckUtils]: 3: Hoare triple {1076#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv7 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1076#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:35,659 INFO L281 TraceCheckUtils]: 2: Hoare triple {1076#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv7 32)) (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {1076#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:35,660 INFO L281 TraceCheckUtils]: 1: Hoare triple {937#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {1076#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv7 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:35,661 INFO L281 TraceCheckUtils]: 0: Hoare triple {937#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {937#true} is VALID [2021-09-13 14:16:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:35,661 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:16:35,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324783009] [2021-09-13 14:16:35,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324783009] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:16:35,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:16:35,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-09-13 14:16:35,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243263031] [2021-09-13 14:16:35,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-09-13 14:16:35,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:35,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:38,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:38,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:16:38,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:16:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:16:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:16:38,177 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:53,942 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:57,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:58,233 INFO L93 Difference]: Finished difference Result 126 states and 184 transitions. [2021-09-13 14:16:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:16:58,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-09-13 14:16:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2021-09-13 14:16:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2021-09-13 14:16:58,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 130 transitions. [2021-09-13 14:17:07,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 127 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:07,048 INFO L225 Difference]: With dead ends: 126 [2021-09-13 14:17:07,049 INFO L226 Difference]: Without dead ends: 92 [2021-09-13 14:17:07,049 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2700.39ms TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:17:07,050 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8655.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.80ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8659.00ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:07,050 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 183 Unknown, 0 Unchecked, 3.80ms Time], IncrementalHoareTripleChecker [13 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 8659.00ms Time] [2021-09-13 14:17:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-09-13 14:17:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2021-09-13 14:17:07,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:07,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 83 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:07,084 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 83 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:07,084 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 83 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:07,087 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2021-09-13 14:17:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2021-09-13 14:17:07,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:07,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:07,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 92 states. [2021-09-13 14:17:07,088 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 92 states. [2021-09-13 14:17:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:07,091 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2021-09-13 14:17:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2021-09-13 14:17:07,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:07,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:07,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:07,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 82 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2021-09-13 14:17:07,095 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 25 [2021-09-13 14:17:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:07,095 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2021-09-13 14:17:07,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2021-09-13 14:17:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-09-13 14:17:07,096 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:07,096 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:07,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:17:07,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:17:07,311 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:17:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1535543721, now seen corresponding path program 1 times [2021-09-13 14:17:07,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:17:07,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112932034] [2021-09-13 14:17:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:07,312 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:17:07,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:17:07,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:17:07,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-09-13 14:17:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:07,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:17:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:07,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:09,803 INFO L281 TraceCheckUtils]: 0: Hoare triple {1514#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {1514#true} is VALID [2021-09-13 14:17:09,804 INFO L281 TraceCheckUtils]: 1: Hoare triple {1514#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {1522#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:09,804 INFO L281 TraceCheckUtils]: 2: Hoare triple {1522#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {1522#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:09,805 INFO L281 TraceCheckUtils]: 3: Hoare triple {1522#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1522#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:09,805 INFO L281 TraceCheckUtils]: 4: Hoare triple {1522#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {1532#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,807 INFO L281 TraceCheckUtils]: 5: Hoare triple {1532#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,808 INFO L281 TraceCheckUtils]: 6: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,809 INFO L281 TraceCheckUtils]: 7: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,809 INFO L281 TraceCheckUtils]: 8: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,810 INFO L281 TraceCheckUtils]: 9: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,810 INFO L281 TraceCheckUtils]: 10: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,811 INFO L281 TraceCheckUtils]: 11: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,811 INFO L281 TraceCheckUtils]: 12: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,812 INFO L281 TraceCheckUtils]: 13: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,813 INFO L281 TraceCheckUtils]: 14: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,813 INFO L281 TraceCheckUtils]: 15: Hoare triple {1536#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1567#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,814 INFO L281 TraceCheckUtils]: 16: Hoare triple {1567#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,814 INFO L281 TraceCheckUtils]: 17: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,815 INFO L281 TraceCheckUtils]: 18: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,815 INFO L281 TraceCheckUtils]: 19: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,816 INFO L281 TraceCheckUtils]: 20: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,817 INFO L281 TraceCheckUtils]: 21: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,817 INFO L281 TraceCheckUtils]: 22: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,818 INFO L281 TraceCheckUtils]: 23: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,818 INFO L281 TraceCheckUtils]: 24: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,819 INFO L281 TraceCheckUtils]: 25: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,819 INFO L281 TraceCheckUtils]: 26: Hoare triple {1571#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {1602#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:09,820 INFO L281 TraceCheckUtils]: 27: Hoare triple {1602#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~v5~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v6~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1606#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:17:09,820 INFO L281 TraceCheckUtils]: 28: Hoare triple {1606#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1515#false} is VALID [2021-09-13 14:17:09,820 INFO L281 TraceCheckUtils]: 29: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2021-09-13 14:17:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:17:09,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:17:23,222 INFO L281 TraceCheckUtils]: 29: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2021-09-13 14:17:23,222 INFO L281 TraceCheckUtils]: 28: Hoare triple {1616#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1515#false} is VALID [2021-09-13 14:17:23,239 INFO L281 TraceCheckUtils]: 27: Hoare triple {1620#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1616#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:17:25,244 INFO L281 TraceCheckUtils]: 26: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {1620#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} is UNKNOWN [2021-09-13 14:17:25,244 INFO L281 TraceCheckUtils]: 25: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,245 INFO L281 TraceCheckUtils]: 24: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,245 INFO L281 TraceCheckUtils]: 23: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,246 INFO L281 TraceCheckUtils]: 22: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,246 INFO L281 TraceCheckUtils]: 21: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,246 INFO L281 TraceCheckUtils]: 20: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,247 INFO L281 TraceCheckUtils]: 19: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,247 INFO L281 TraceCheckUtils]: 18: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,247 INFO L281 TraceCheckUtils]: 17: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:25,264 INFO L281 TraceCheckUtils]: 16: Hoare triple {1620#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,268 INFO L281 TraceCheckUtils]: 15: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1620#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} is UNKNOWN [2021-09-13 14:17:27,269 INFO L281 TraceCheckUtils]: 14: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,269 INFO L281 TraceCheckUtils]: 13: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,269 INFO L281 TraceCheckUtils]: 12: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,270 INFO L281 TraceCheckUtils]: 11: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,270 INFO L281 TraceCheckUtils]: 10: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,270 INFO L281 TraceCheckUtils]: 9: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,271 INFO L281 TraceCheckUtils]: 8: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,274 INFO L281 TraceCheckUtils]: 7: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,274 INFO L281 TraceCheckUtils]: 6: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:27,293 INFO L281 TraceCheckUtils]: 5: Hoare triple {1620#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:29,302 INFO L281 TraceCheckUtils]: 4: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {1620#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)))} is UNKNOWN [2021-09-13 14:17:29,303 INFO L281 TraceCheckUtils]: 3: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:29,304 INFO L281 TraceCheckUtils]: 2: Hoare triple {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} assume !!~bvule32(main_~n~0, ~SIZE~0); {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:29,304 INFO L281 TraceCheckUtils]: 1: Hoare triple {1514#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {1624#(= (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v5~0 ULTIMATE.start_main_~v6~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:17:29,304 INFO L281 TraceCheckUtils]: 0: Hoare triple {1514#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {1514#true} is VALID [2021-09-13 14:17:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-09-13 14:17:29,305 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:17:29,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112932034] [2021-09-13 14:17:29,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112932034] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:17:29,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:17:29,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2021-09-13 14:17:29,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313617146] [2021-09-13 14:17:29,306 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-09-13 14:17:29,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:29,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:35,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 44 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:35,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:17:35,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:17:35,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:17:35,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:17:35,684 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:40,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:42,993 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:45,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:47,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:50,344 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:54,251 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:54,848 INFO L93 Difference]: Finished difference Result 133 states and 190 transitions. [2021-09-13 14:17:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:17:54,849 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-09-13 14:17:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2021-09-13 14:17:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2021-09-13 14:17:54,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 71 transitions. [2021-09-13 14:18:01,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 68 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:01,489 INFO L225 Difference]: With dead ends: 133 [2021-09-13 14:18:01,489 INFO L226 Difference]: Without dead ends: 131 [2021-09-13 14:18:01,489 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1030.02ms TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:18:01,490 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 26 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15267.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.19ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15291.23ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:01,490 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 313 Unknown, 0 Unchecked, 5.19ms Time], IncrementalHoareTripleChecker [26 Valid, 281 Invalid, 6 Unknown, 0 Unchecked, 15291.23ms Time] [2021-09-13 14:18:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-09-13 14:18:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2021-09-13 14:18:01,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:01,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 126 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:01,542 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 126 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:01,542 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 126 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:01,559 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2021-09-13 14:18:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2021-09-13 14:18:01,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:01,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:01,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 131 states. [2021-09-13 14:18:01,563 INFO L87 Difference]: Start difference. First operand has 126 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 131 states. [2021-09-13 14:18:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:01,566 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2021-09-13 14:18:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2021-09-13 14:18:01,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:01,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:01,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:01,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2021-09-13 14:18:01,570 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 30 [2021-09-13 14:18:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:01,572 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2021-09-13 14:18:01,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2021-09-13 14:18:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-09-13 14:18:01,573 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:01,574 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:01,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:01,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:18:01,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:18:01,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:01,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2120154383, now seen corresponding path program 1 times [2021-09-13 14:18:01,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:18:01,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532024975] [2021-09-13 14:18:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:01,781 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:18:01,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:18:01,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:18:01,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-09-13 14:18:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:01,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:18:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:02,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:02,217 INFO L281 TraceCheckUtils]: 0: Hoare triple {2267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {2267#true} is VALID [2021-09-13 14:18:02,217 INFO L281 TraceCheckUtils]: 1: Hoare triple {2267#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {2275#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:18:02,217 INFO L281 TraceCheckUtils]: 2: Hoare triple {2275#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvule32(main_~n~0, ~SIZE~0); {2275#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:18:02,218 INFO L281 TraceCheckUtils]: 3: Hoare triple {2275#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvult32(main_~l~0, main_~n~0); {2275#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:18:02,218 INFO L281 TraceCheckUtils]: 4: Hoare triple {2275#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {2275#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:18:02,218 INFO L281 TraceCheckUtils]: 5: Hoare triple {2275#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,219 INFO L281 TraceCheckUtils]: 6: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == __VERIFIER_assert_~cond); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,219 INFO L281 TraceCheckUtils]: 7: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !!~bvult32(main_~l~0, main_~n~0); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,220 INFO L281 TraceCheckUtils]: 8: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,220 INFO L281 TraceCheckUtils]: 9: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,220 INFO L281 TraceCheckUtils]: 10: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,221 INFO L281 TraceCheckUtils]: 11: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,221 INFO L281 TraceCheckUtils]: 12: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,221 INFO L281 TraceCheckUtils]: 13: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,222 INFO L281 TraceCheckUtils]: 14: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,222 INFO L281 TraceCheckUtils]: 15: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:18:02,223 INFO L281 TraceCheckUtils]: 16: Hoare triple {2288#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,223 INFO L281 TraceCheckUtils]: 17: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,223 INFO L281 TraceCheckUtils]: 18: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,224 INFO L281 TraceCheckUtils]: 19: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,224 INFO L281 TraceCheckUtils]: 20: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,224 INFO L281 TraceCheckUtils]: 21: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,225 INFO L281 TraceCheckUtils]: 22: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,225 INFO L281 TraceCheckUtils]: 23: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,226 INFO L281 TraceCheckUtils]: 24: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,226 INFO L281 TraceCheckUtils]: 25: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,226 INFO L281 TraceCheckUtils]: 26: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,227 INFO L281 TraceCheckUtils]: 27: Hoare triple {2322#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,227 INFO L281 TraceCheckUtils]: 28: Hoare triple {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,228 INFO L281 TraceCheckUtils]: 29: Hoare triple {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,228 INFO L281 TraceCheckUtils]: 30: Hoare triple {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,228 INFO L281 TraceCheckUtils]: 31: Hoare triple {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,229 INFO L281 TraceCheckUtils]: 32: Hoare triple {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:18:02,229 INFO L281 TraceCheckUtils]: 33: Hoare triple {2356#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 6bv32);main_~v2~0 := ~bvadd32(1bv32, main_~v2~0); {2268#false} is VALID [2021-09-13 14:18:02,229 INFO L281 TraceCheckUtils]: 34: Hoare triple {2268#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2268#false} is VALID [2021-09-13 14:18:02,229 INFO L281 TraceCheckUtils]: 35: Hoare triple {2268#false} assume 0bv32 == __VERIFIER_assert_~cond; {2268#false} is VALID [2021-09-13 14:18:02,229 INFO L281 TraceCheckUtils]: 36: Hoare triple {2268#false} assume !false; {2268#false} is VALID [2021-09-13 14:18:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:02,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:04,200 INFO L281 TraceCheckUtils]: 36: Hoare triple {2268#false} assume !false; {2268#false} is VALID [2021-09-13 14:18:04,200 INFO L281 TraceCheckUtils]: 35: Hoare triple {2268#false} assume 0bv32 == __VERIFIER_assert_~cond; {2268#false} is VALID [2021-09-13 14:18:04,201 INFO L281 TraceCheckUtils]: 34: Hoare triple {2268#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2268#false} is VALID [2021-09-13 14:18:04,201 INFO L281 TraceCheckUtils]: 33: Hoare triple {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 6bv32);main_~v2~0 := ~bvadd32(1bv32, main_~v2~0); {2268#false} is VALID [2021-09-13 14:18:04,201 INFO L281 TraceCheckUtils]: 32: Hoare triple {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:04,201 INFO L281 TraceCheckUtils]: 31: Hoare triple {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:04,202 INFO L281 TraceCheckUtils]: 30: Hoare triple {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:04,202 INFO L281 TraceCheckUtils]: 29: Hoare triple {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:04,202 INFO L281 TraceCheckUtils]: 28: Hoare triple {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:04,203 INFO L281 TraceCheckUtils]: 27: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2393#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:04,203 INFO L281 TraceCheckUtils]: 26: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,203 INFO L281 TraceCheckUtils]: 25: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,204 INFO L281 TraceCheckUtils]: 24: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,209 INFO L281 TraceCheckUtils]: 23: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,209 INFO L281 TraceCheckUtils]: 22: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,209 INFO L281 TraceCheckUtils]: 21: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,210 INFO L281 TraceCheckUtils]: 20: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,210 INFO L281 TraceCheckUtils]: 19: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,210 INFO L281 TraceCheckUtils]: 18: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:04,211 INFO L281 TraceCheckUtils]: 17: Hoare triple {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !(0bv32 == __VERIFIER_assert_~cond); {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,221 INFO L281 TraceCheckUtils]: 16: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2412#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is UNKNOWN [2021-09-13 14:18:06,222 INFO L281 TraceCheckUtils]: 15: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,222 INFO L281 TraceCheckUtils]: 14: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,223 INFO L281 TraceCheckUtils]: 13: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,224 INFO L281 TraceCheckUtils]: 12: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,224 INFO L281 TraceCheckUtils]: 11: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,224 INFO L281 TraceCheckUtils]: 10: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,225 INFO L281 TraceCheckUtils]: 9: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 8bv32)); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,229 INFO L281 TraceCheckUtils]: 8: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 9bv32)); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,229 INFO L281 TraceCheckUtils]: 7: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:06,230 INFO L281 TraceCheckUtils]: 6: Hoare triple {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} assume !(0bv32 == __VERIFIER_assert_~cond); {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is VALID [2021-09-13 14:18:08,239 INFO L281 TraceCheckUtils]: 5: Hoare triple {2480#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv6 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0), main_~v5~0), main_~v6~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2446#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv6 32))))} is UNKNOWN [2021-09-13 14:18:08,240 INFO L281 TraceCheckUtils]: 4: Hoare triple {2480#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv6 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 9bv32);main_~v6~0 := ~bvadd32(1bv32, main_~v6~0); {2480#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:08,240 INFO L281 TraceCheckUtils]: 3: Hoare triple {2480#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv6 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {2480#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:08,240 INFO L281 TraceCheckUtils]: 2: Hoare triple {2480#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv6 32)) (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {2480#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:08,241 INFO L281 TraceCheckUtils]: 1: Hoare triple {2267#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~0, main_~v3~0, main_~v4~0, main_~v5~0, main_~v6~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~v5~0 := 0bv32;main_~v6~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {2480#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:18:08,241 INFO L281 TraceCheckUtils]: 0: Hoare triple {2267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {2267#true} is VALID [2021-09-13 14:18:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:08,241 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:18:08,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532024975] [2021-09-13 14:18:08,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532024975] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:08,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:08,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-09-13 14:18:08,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526743294] [2021-09-13 14:18:08,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-09-13 14:18:08,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:08,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:12,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 68 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:12,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:18:12,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:18:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:18:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:18:12,922 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:18,283 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:18:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:18:18,295 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1582.64ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:18:18,296 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3341.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.84ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3342.83ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:18,296 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 150 Unknown, 0 Unchecked, 1.84ms Time], IncrementalHoareTripleChecker [9 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 3342.83ms Time] [2021-09-13 14:18:18,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:18,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:18:18,497 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@594f9b59 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.reviewInductiveInternal(ChainingHoareTripleChecker.java:318) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:290) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:863) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:779) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-09-13 14:18:18,500 INFO L158 Benchmark]: Toolchain (without parser) took 188355.34ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 29.5MB in the beginning and 55.0MB in the end (delta: -25.5MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2021-09-13 14:18:18,500 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.1MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:18:18,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.75ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.3MB in the beginning and 45.6MB in the end (delta: -16.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2021-09-13 14:18:18,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.77ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 43.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:18:18,501 INFO L158 Benchmark]: Boogie Preprocessor took 29.75ms. Allocated memory is still 62.9MB. Free memory was 43.9MB in the beginning and 42.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:18:18,501 INFO L158 Benchmark]: RCFGBuilder took 244.87ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 32.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:18:18,501 INFO L158 Benchmark]: TraceAbstraction took 187760.56ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 55.0MB in the end (delta: -23.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2021-09-13 14:18:18,503 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.1MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.75ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.3MB in the beginning and 45.6MB in the end (delta: -16.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.77ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 43.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.75ms. Allocated memory is still 62.9MB. Free memory was 43.9MB in the beginning and 42.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 244.87ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 32.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 187760.56ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 55.0MB in the end (delta: -23.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@594f9b59 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@594f9b59: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-09-13 14:18:18,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...