./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/prefixsum_iter.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:26,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:26,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:26,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:26,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:26,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:26,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:26,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:26,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:26,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:26,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:26,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:26,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:26,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:26,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:26,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:26,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:26,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:26,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:26,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:26,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:26,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:26,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:26,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:26,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:26,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:26,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:26,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:26,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:26,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:26,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:26,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:26,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:26,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:26,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:26,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:26,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:26,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:26,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:26,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:26,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:26,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:43:26,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:26,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:26,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:26,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:26,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:26,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:26,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:26,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:26,140 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:26,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:26,141 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:43:26,141 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:26,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:26,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:43:26,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:26,141 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:26,142 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:26,142 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:26,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:26,142 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:26,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:43:26,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:26,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:26,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:26,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:26,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:26,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:26,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:26,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:43:26,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:43:26,144 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2022-02-20 23:43:26,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:26,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:26,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:26,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:26,363 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:26,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-02-20 23:43:26,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8dd804f/b9f017d6c63c4b909f8a3f986125fbc2/FLAG4e1c85229 [2022-02-20 23:43:26,754 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:26,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-02-20 23:43:26,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8dd804f/b9f017d6c63c4b909f8a3f986125fbc2/FLAG4e1c85229 [2022-02-20 23:43:27,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8dd804f/b9f017d6c63c4b909f8a3f986125fbc2 [2022-02-20 23:43:27,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:27,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:27,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:27,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:27,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:27,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca7b490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27, skipping insertion in model container [2022-02-20 23:43:27,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:27,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:27,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2022-02-20 23:43:27,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:27,368 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:43:27,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2022-02-20 23:43:27,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:27,395 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:43:27,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27 WrapperNode [2022-02-20 23:43:27,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:27,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:27,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:43:27,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:43:27,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,434 INFO L137 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-02-20 23:43:27,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:27,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:43:27,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:43:27,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:43:27,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:43:27,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:43:27,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:43:27,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:43:27,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (1/1) ... [2022-02-20 23:43:27,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:27,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:27,487 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) [2022-02-20 23:43:27,491 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 [2022-02-20 23:43:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:43:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 23:43:27,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 23:43:27,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:43:27,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:43:27,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:43:27,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:43:27,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:43:27,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:43:27,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 23:43:27,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 23:43:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:43:27,566 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:43:27,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:43:27,888 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:43:27,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:43:27,894 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 23:43:27,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:27 BoogieIcfgContainer [2022-02-20 23:43:27,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:43:27,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:43:27,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:43:27,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:43:27,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:43:27" (1/3) ... [2022-02-20 23:43:27,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ce2038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:27, skipping insertion in model container [2022-02-20 23:43:27,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:27" (2/3) ... [2022-02-20 23:43:27,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ce2038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:27, skipping insertion in model container [2022-02-20 23:43:27,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:27" (3/3) ... [2022-02-20 23:43:27,913 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-02-20 23:43:27,921 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:43:27,924 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-02-20 23:43:27,962 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:43:27,975 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-02-20 23:43:27,977 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-02-20 23:43:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 61 states have (on average 1.819672131147541) internal successors, (111), 95 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:43:28,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:28,005 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:28,005 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:43:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1116940539, now seen corresponding path program 1 times [2022-02-20 23:43:28,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:28,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026035971] [2022-02-20 23:43:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:28,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:28,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:43:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:28,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 23:43:28,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume 0 == ~cond;assume false; {106#false} is VALID [2022-02-20 23:43:28,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 23:43:28,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#false} {105#true} #189#return; {106#false} is VALID [2022-02-20 23:43:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:43:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:28,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 23:43:28,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume 0 == ~cond;assume false; {106#false} is VALID [2022-02-20 23:43:28,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 23:43:28,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#false} {106#false} #191#return; {106#false} is VALID [2022-02-20 23:43:28,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:43:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:28,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {105#true} is VALID [2022-02-20 23:43:28,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 23:43:28,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105#true} {106#false} #193#return; {106#false} is VALID [2022-02-20 23:43:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:43:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:28,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {105#true} is VALID [2022-02-20 23:43:28,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 23:43:28,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105#true} {106#false} #195#return; {106#false} is VALID [2022-02-20 23:43:28,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {105#true} is VALID [2022-02-20 23:43:28,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {105#true} is VALID [2022-02-20 23:43:28,226 INFO L272 TraceCheckUtils]: 2: Hoare triple {105#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {105#true} is VALID [2022-02-20 23:43:28,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 23:43:28,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} assume 0 == ~cond;assume false; {106#false} is VALID [2022-02-20 23:43:28,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 23:43:28,227 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {106#false} {105#true} #189#return; {106#false} is VALID [2022-02-20 23:43:28,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {106#false} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {106#false} is VALID [2022-02-20 23:43:28,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {106#false} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {106#false} is VALID [2022-02-20 23:43:28,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {106#false} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {106#false} is VALID [2022-02-20 23:43:28,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {106#false} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {106#false} is VALID [2022-02-20 23:43:28,228 INFO L272 TraceCheckUtils]: 11: Hoare triple {106#false} call assume_abort_if_not(main_#t~ret14#1); {105#true} is VALID [2022-02-20 23:43:28,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 23:43:28,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {105#true} assume 0 == ~cond;assume false; {106#false} is VALID [2022-02-20 23:43:28,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 23:43:28,229 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {106#false} {106#false} #191#return; {106#false} is VALID [2022-02-20 23:43:28,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {106#false} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {106#false} is VALID [2022-02-20 23:43:28,230 INFO L272 TraceCheckUtils]: 17: Hoare triple {106#false} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {121#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:28,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {121#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {105#true} is VALID [2022-02-20 23:43:28,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 23:43:28,230 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {105#true} {106#false} #193#return; {106#false} is VALID [2022-02-20 23:43:28,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {106#false} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {106#false} is VALID [2022-02-20 23:43:28,231 INFO L272 TraceCheckUtils]: 22: Hoare triple {106#false} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {121#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:28,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {121#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {105#true} is VALID [2022-02-20 23:43:28,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 23:43:28,231 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {105#true} {106#false} #195#return; {106#false} is VALID [2022-02-20 23:43:28,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {106#false} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {106#false} is VALID [2022-02-20 23:43:28,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {106#false} assume !!(main_~i~1#1 < main_~n~0#1); {106#false} is VALID [2022-02-20 23:43:28,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {106#false} assume !(1 == #valid[main_~a~0#1.base]); {106#false} is VALID [2022-02-20 23:43:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:43:28,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:28,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026035971] [2022-02-20 23:43:28,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026035971] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:28,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:28,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:28,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64577894] [2022-02-20 23:43:28,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:28,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 23:43:28,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:28,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:28,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:28,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:28,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:28,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:28,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:28,297 INFO L87 Difference]: Start difference. First operand has 102 states, 61 states have (on average 1.819672131147541) internal successors, (111), 95 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:30,647 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-02-20 23:43:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:30,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 23:43:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-20 23:43:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-20 23:43:30,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2022-02-20 23:43:30,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:30,769 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:43:30,769 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 23:43:30,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:30,772 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:30,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 195 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 23:43:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-02-20 23:43:30,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:30,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:30,813 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:30,813 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:30,820 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-02-20 23:43:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-02-20 23:43:30,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:30,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:30,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 100 states. [2022-02-20 23:43:30,822 INFO L87 Difference]: Start difference. First operand has 100 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 100 states. [2022-02-20 23:43:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:30,827 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-02-20 23:43:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-02-20 23:43:30,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:30,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:30,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:30,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2022-02-20 23:43:30,833 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 29 [2022-02-20 23:43:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:30,833 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2022-02-20 23:43:30,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-02-20 23:43:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:43:30,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:30,835 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:30,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:43:30,835 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:43:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash 236420795, now seen corresponding path program 1 times [2022-02-20 23:43:30,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:30,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943816893] [2022-02-20 23:43:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:30,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:43:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:30,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#true} ~cond := #in~cond; {526#true} is VALID [2022-02-20 23:43:30,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume !(0 == ~cond); {526#true} is VALID [2022-02-20 23:43:30,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 23:43:30,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #189#return; {526#true} is VALID [2022-02-20 23:43:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:43:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:30,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#true} ~cond := #in~cond; {526#true} is VALID [2022-02-20 23:43:30,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume !(0 == ~cond); {526#true} is VALID [2022-02-20 23:43:30,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 23:43:30,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #191#return; {526#true} is VALID [2022-02-20 23:43:30,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:43:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:30,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {526#true} is VALID [2022-02-20 23:43:30,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 23:43:30,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {526#true} {536#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} #193#return; {536#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} is VALID [2022-02-20 23:43:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:43:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:30,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {526#true} is VALID [2022-02-20 23:43:30,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 23:43:30,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {526#true} {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} #195#return; {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:30,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {526#true} is VALID [2022-02-20 23:43:30,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {526#true} is VALID [2022-02-20 23:43:30,981 INFO L272 TraceCheckUtils]: 2: Hoare triple {526#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {526#true} is VALID [2022-02-20 23:43:30,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {526#true} ~cond := #in~cond; {526#true} is VALID [2022-02-20 23:43:30,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {526#true} assume !(0 == ~cond); {526#true} is VALID [2022-02-20 23:43:30,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 23:43:30,983 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {526#true} {526#true} #189#return; {526#true} is VALID [2022-02-20 23:43:30,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {526#true} is VALID [2022-02-20 23:43:30,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {526#true} is VALID [2022-02-20 23:43:30,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {526#true} is VALID [2022-02-20 23:43:30,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {526#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {526#true} is VALID [2022-02-20 23:43:30,984 INFO L272 TraceCheckUtils]: 11: Hoare triple {526#true} call assume_abort_if_not(main_#t~ret14#1); {526#true} is VALID [2022-02-20 23:43:30,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#true} ~cond := #in~cond; {526#true} is VALID [2022-02-20 23:43:30,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {526#true} assume !(0 == ~cond); {526#true} is VALID [2022-02-20 23:43:30,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 23:43:30,986 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {526#true} {526#true} #191#return; {526#true} is VALID [2022-02-20 23:43:30,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {526#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {536#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} is VALID [2022-02-20 23:43:30,988 INFO L272 TraceCheckUtils]: 17: Hoare triple {536#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {544#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:30,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {544#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {526#true} is VALID [2022-02-20 23:43:30,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 23:43:30,993 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {526#true} {536#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} #193#return; {536#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} is VALID [2022-02-20 23:43:30,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:30,995 INFO L272 TraceCheckUtils]: 22: Hoare triple {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {544#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:30,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {544#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {526#true} is VALID [2022-02-20 23:43:30,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 23:43:30,996 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {526#true} {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} #195#return; {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:30,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:30,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !!(main_~i~1#1 < main_~n~0#1); {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:30,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {540#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !(1 == #valid[main_~a~0#1.base]); {527#false} is VALID [2022-02-20 23:43:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:43:30,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:30,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943816893] [2022-02-20 23:43:30,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943816893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:30,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:30,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:30,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910463123] [2022-02-20 23:43:31,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:31,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 23:43:31,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:31,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:31,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:31,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:31,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:31,034 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:37,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:37,873 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-02-20 23:43:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:37,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 23:43:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-02-20 23:43:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-02-20 23:43:37,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 108 transitions. [2022-02-20 23:43:37,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:37,974 INFO L225 Difference]: With dead ends: 98 [2022-02-20 23:43:37,974 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 23:43:37,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:43:37,975 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 153 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:37,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 158 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:43:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 23:43:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-20 23:43:37,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:37,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:37,979 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:37,980 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:37,987 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-02-20 23:43:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-02-20 23:43:37,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:37,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:37,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 98 states. [2022-02-20 23:43:37,990 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 98 states. [2022-02-20 23:43:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:37,998 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-02-20 23:43:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-02-20 23:43:38,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:38,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:38,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:38,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-02-20 23:43:38,007 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 29 [2022-02-20 23:43:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:38,007 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-02-20 23:43:38,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-02-20 23:43:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:43:38,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:38,008 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:38,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:43:38,009 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:43:38,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash 236420796, now seen corresponding path program 1 times [2022-02-20 23:43:38,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:38,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494479718] [2022-02-20 23:43:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:43:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:38,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {941#true} ~cond := #in~cond; {941#true} is VALID [2022-02-20 23:43:38,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume !(0 == ~cond); {941#true} is VALID [2022-02-20 23:43:38,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-02-20 23:43:38,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #189#return; {941#true} is VALID [2022-02-20 23:43:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:43:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:38,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {941#true} ~cond := #in~cond; {941#true} is VALID [2022-02-20 23:43:38,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume !(0 == ~cond); {941#true} is VALID [2022-02-20 23:43:38,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-02-20 23:43:38,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #191#return; {941#true} is VALID [2022-02-20 23:43:38,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:43:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:38,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {961#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {941#true} is VALID [2022-02-20 23:43:38,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume true; {941#true} is VALID [2022-02-20 23:43:38,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {941#true} {951#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} #193#return; {951#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} is VALID [2022-02-20 23:43:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:43:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:38,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {961#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {941#true} is VALID [2022-02-20 23:43:38,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume true; {941#true} is VALID [2022-02-20 23:43:38,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {941#true} {955#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} #195#return; {955#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:43:38,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {941#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {941#true} is VALID [2022-02-20 23:43:38,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {941#true} is VALID [2022-02-20 23:43:38,217 INFO L272 TraceCheckUtils]: 2: Hoare triple {941#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {941#true} is VALID [2022-02-20 23:43:38,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {941#true} ~cond := #in~cond; {941#true} is VALID [2022-02-20 23:43:38,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {941#true} assume !(0 == ~cond); {941#true} is VALID [2022-02-20 23:43:38,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {941#true} assume true; {941#true} is VALID [2022-02-20 23:43:38,221 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {941#true} {941#true} #189#return; {941#true} is VALID [2022-02-20 23:43:38,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {941#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {941#true} is VALID [2022-02-20 23:43:38,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {941#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {941#true} is VALID [2022-02-20 23:43:38,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {941#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {941#true} is VALID [2022-02-20 23:43:38,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {941#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {941#true} is VALID [2022-02-20 23:43:38,222 INFO L272 TraceCheckUtils]: 11: Hoare triple {941#true} call assume_abort_if_not(main_#t~ret14#1); {941#true} is VALID [2022-02-20 23:43:38,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {941#true} ~cond := #in~cond; {941#true} is VALID [2022-02-20 23:43:38,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {941#true} assume !(0 == ~cond); {941#true} is VALID [2022-02-20 23:43:38,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {941#true} assume true; {941#true} is VALID [2022-02-20 23:43:38,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {941#true} {941#true} #191#return; {941#true} is VALID [2022-02-20 23:43:38,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {941#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {951#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} is VALID [2022-02-20 23:43:38,225 INFO L272 TraceCheckUtils]: 17: Hoare triple {951#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {961#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:38,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {961#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {941#true} is VALID [2022-02-20 23:43:38,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {941#true} assume true; {941#true} is VALID [2022-02-20 23:43:38,226 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {941#true} {951#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} #193#return; {951#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} is VALID [2022-02-20 23:43:38,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {951#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {955#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:43:38,228 INFO L272 TraceCheckUtils]: 22: Hoare triple {955#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {961#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:38,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {961#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {941#true} is VALID [2022-02-20 23:43:38,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {941#true} assume true; {941#true} is VALID [2022-02-20 23:43:38,229 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {941#true} {955#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} #195#return; {955#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:43:38,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {955#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {959#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:43:38,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {959#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~1#1 < main_~n~0#1); {960#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:43:38,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {960#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(4 + (main_~a~0#1.offset + 4 * main_~i~1#1) <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset + 4 * main_~i~1#1); {942#false} is VALID [2022-02-20 23:43:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:43:38,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:38,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494479718] [2022-02-20 23:43:38,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494479718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:38,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:38,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:43:38,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850154086] [2022-02-20 23:43:38,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 23:43:38,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:38,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:38,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:38,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:43:38,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:38,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:43:38,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:38,251 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:41,386 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2022-02-20 23:43:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:43:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 23:43:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2022-02-20 23:43:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2022-02-20 23:43:41,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 189 transitions. [2022-02-20 23:43:41,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:41,568 INFO L225 Difference]: With dead ends: 173 [2022-02-20 23:43:41,568 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 23:43:41,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:43:41,569 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 395 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:41,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 194 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:43:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 23:43:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 99. [2022-02-20 23:43:41,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:41,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 99 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:41,574 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 99 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:41,575 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 99 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:41,578 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2022-02-20 23:43:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 186 transitions. [2022-02-20 23:43:41,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:41,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:41,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 173 states. [2022-02-20 23:43:41,580 INFO L87 Difference]: Start difference. First operand has 99 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 173 states. [2022-02-20 23:43:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:41,584 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2022-02-20 23:43:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 186 transitions. [2022-02-20 23:43:41,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:41,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:41,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:41,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-02-20 23:43:41,587 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 29 [2022-02-20 23:43:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:41,588 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-02-20 23:43:41,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:43:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:43:41,588 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:41,588 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:41,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:43:41,589 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:43:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1260889940, now seen corresponding path program 1 times [2022-02-20 23:43:41,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:41,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21974584] [2022-02-20 23:43:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:43:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:41,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {1588#true} ~cond := #in~cond; {1588#true} is VALID [2022-02-20 23:43:41,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1588#true} assume !(0 == ~cond); {1588#true} is VALID [2022-02-20 23:43:41,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {1588#true} assume true; {1588#true} is VALID [2022-02-20 23:43:41,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1588#true} {1588#true} #189#return; {1588#true} is VALID [2022-02-20 23:43:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:43:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:41,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {1588#true} ~cond := #in~cond; {1588#true} is VALID [2022-02-20 23:43:41,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1588#true} assume !(0 == ~cond); {1588#true} is VALID [2022-02-20 23:43:41,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1588#true} assume true; {1588#true} is VALID [2022-02-20 23:43:41,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1588#true} {1588#true} #191#return; {1588#true} is VALID [2022-02-20 23:43:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:43:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:41,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {1606#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1588#true} is VALID [2022-02-20 23:43:41,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {1588#true} assume true; {1588#true} is VALID [2022-02-20 23:43:41,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1588#true} {1588#true} #193#return; {1588#true} is VALID [2022-02-20 23:43:41,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:43:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:41,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {1606#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1588#true} is VALID [2022-02-20 23:43:41,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {1588#true} assume true; {1588#true} is VALID [2022-02-20 23:43:41,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1588#true} {1601#(= (select |#valid| |ULTIMATE.start_main_#t~malloc16#1.base|) 1)} #195#return; {1601#(= (select |#valid| |ULTIMATE.start_main_#t~malloc16#1.base|) 1)} is VALID [2022-02-20 23:43:41,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {1588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1588#true} is VALID [2022-02-20 23:43:41,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {1588#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1588#true} is VALID [2022-02-20 23:43:41,642 INFO L272 TraceCheckUtils]: 2: Hoare triple {1588#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {1588#true} is VALID [2022-02-20 23:43:41,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {1588#true} ~cond := #in~cond; {1588#true} is VALID [2022-02-20 23:43:41,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {1588#true} assume !(0 == ~cond); {1588#true} is VALID [2022-02-20 23:43:41,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {1588#true} assume true; {1588#true} is VALID [2022-02-20 23:43:41,643 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1588#true} {1588#true} #189#return; {1588#true} is VALID [2022-02-20 23:43:41,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {1588#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {1588#true} is VALID [2022-02-20 23:43:41,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {1588#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {1588#true} is VALID [2022-02-20 23:43:41,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {1588#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {1588#true} is VALID [2022-02-20 23:43:41,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {1588#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {1588#true} is VALID [2022-02-20 23:43:41,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {1588#true} call assume_abort_if_not(main_#t~ret14#1); {1588#true} is VALID [2022-02-20 23:43:41,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {1588#true} ~cond := #in~cond; {1588#true} is VALID [2022-02-20 23:43:41,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {1588#true} assume !(0 == ~cond); {1588#true} is VALID [2022-02-20 23:43:41,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {1588#true} assume true; {1588#true} is VALID [2022-02-20 23:43:41,644 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1588#true} {1588#true} #191#return; {1588#true} is VALID [2022-02-20 23:43:41,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {1588#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1588#true} is VALID [2022-02-20 23:43:41,645 INFO L272 TraceCheckUtils]: 17: Hoare triple {1588#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1606#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:41,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {1606#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1588#true} is VALID [2022-02-20 23:43:41,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {1588#true} assume true; {1588#true} is VALID [2022-02-20 23:43:41,645 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1588#true} {1588#true} #193#return; {1588#true} is VALID [2022-02-20 23:43:41,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {1588#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1601#(= (select |#valid| |ULTIMATE.start_main_#t~malloc16#1.base|) 1)} is VALID [2022-02-20 23:43:41,647 INFO L272 TraceCheckUtils]: 22: Hoare triple {1601#(= (select |#valid| |ULTIMATE.start_main_#t~malloc16#1.base|) 1)} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1606#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:41,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {1606#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1588#true} is VALID [2022-02-20 23:43:41,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {1588#true} assume true; {1588#true} is VALID [2022-02-20 23:43:41,648 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1588#true} {1601#(= (select |#valid| |ULTIMATE.start_main_#t~malloc16#1.base|) 1)} #195#return; {1601#(= (select |#valid| |ULTIMATE.start_main_#t~malloc16#1.base|) 1)} is VALID [2022-02-20 23:43:41,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {1601#(= (select |#valid| |ULTIMATE.start_main_#t~malloc16#1.base|) 1)} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {1605#(= (select |#valid| |ULTIMATE.start_main_~a0~0#1.base|) 1)} is VALID [2022-02-20 23:43:41,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {1605#(= (select |#valid| |ULTIMATE.start_main_~a0~0#1.base|) 1)} assume !!(main_~i~1#1 < main_~n~0#1); {1605#(= (select |#valid| |ULTIMATE.start_main_~a0~0#1.base|) 1)} is VALID [2022-02-20 23:43:41,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {1605#(= (select |#valid| |ULTIMATE.start_main_~a0~0#1.base|) 1)} SUMMARY for call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L70 {1605#(= (select |#valid| |ULTIMATE.start_main_~a0~0#1.base|) 1)} is VALID [2022-02-20 23:43:41,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {1605#(= (select |#valid| |ULTIMATE.start_main_~a0~0#1.base|) 1)} assume !(1 == #valid[main_~a0~0#1.base]); {1589#false} is VALID [2022-02-20 23:43:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:43:41,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:41,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21974584] [2022-02-20 23:43:41,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21974584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:41,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:41,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:41,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445719582] [2022-02-20 23:43:41,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:41,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-02-20 23:43:41,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:41,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:41,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:41,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:41,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:41,668 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,415 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-02-20 23:43:48,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:48,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-02-20 23:43:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-02-20 23:43:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-02-20 23:43:48,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 105 transitions. [2022-02-20 23:43:48,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:48,494 INFO L225 Difference]: With dead ends: 98 [2022-02-20 23:43:48,494 INFO L226 Difference]: Without dead ends: 98 [2022-02-20 23:43:48,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:43:48,495 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 148 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:48,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 166 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:43:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-20 23:43:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-20 23:43:48,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:48,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 62 states have (on average 1.596774193548387) internal successors, (99), 91 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:48,500 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 62 states have (on average 1.596774193548387) internal successors, (99), 91 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:48,500 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 62 states have (on average 1.596774193548387) internal successors, (99), 91 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,510 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-02-20 23:43:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-02-20 23:43:48,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:48,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:48,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 62 states have (on average 1.596774193548387) internal successors, (99), 91 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 98 states. [2022-02-20 23:43:48,512 INFO L87 Difference]: Start difference. First operand has 98 states, 62 states have (on average 1.596774193548387) internal successors, (99), 91 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 98 states. [2022-02-20 23:43:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:48,514 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-02-20 23:43:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-02-20 23:43:48,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:48,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:48,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:48,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.596774193548387) internal successors, (99), 91 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-02-20 23:43:48,517 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 30 [2022-02-20 23:43:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:48,517 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-02-20 23:43:48,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-02-20 23:43:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:43:48,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:48,518 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:48,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:43:48,518 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:43:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1260889939, now seen corresponding path program 1 times [2022-02-20 23:43:48,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:48,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027472265] [2022-02-20 23:43:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:43:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {2003#true} ~cond := #in~cond; {2003#true} is VALID [2022-02-20 23:43:48,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {2003#true} assume !(0 == ~cond); {2003#true} is VALID [2022-02-20 23:43:48,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-02-20 23:43:48,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2003#true} {2003#true} #189#return; {2003#true} is VALID [2022-02-20 23:43:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:43:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {2003#true} ~cond := #in~cond; {2003#true} is VALID [2022-02-20 23:43:48,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {2003#true} assume !(0 == ~cond); {2003#true} is VALID [2022-02-20 23:43:48,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-02-20 23:43:48,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2003#true} {2003#true} #191#return; {2003#true} is VALID [2022-02-20 23:43:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:43:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {2022#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2003#true} is VALID [2022-02-20 23:43:48,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-02-20 23:43:48,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2003#true} {2003#true} #193#return; {2003#true} is VALID [2022-02-20 23:43:48,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:43:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:48,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {2022#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2003#true} is VALID [2022-02-20 23:43:48,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-02-20 23:43:48,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2003#true} {2016#(and (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc16#1.base|) (* |ULTIMATE.start_main_~n~0#1| 4)))} #195#return; {2016#(and (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc16#1.base|) (* |ULTIMATE.start_main_~n~0#1| 4)))} is VALID [2022-02-20 23:43:48,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {2003#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2003#true} is VALID [2022-02-20 23:43:48,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {2003#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2003#true} is VALID [2022-02-20 23:43:48,620 INFO L272 TraceCheckUtils]: 2: Hoare triple {2003#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {2003#true} is VALID [2022-02-20 23:43:48,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {2003#true} ~cond := #in~cond; {2003#true} is VALID [2022-02-20 23:43:48,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {2003#true} assume !(0 == ~cond); {2003#true} is VALID [2022-02-20 23:43:48,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-02-20 23:43:48,621 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2003#true} {2003#true} #189#return; {2003#true} is VALID [2022-02-20 23:43:48,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {2003#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {2003#true} is VALID [2022-02-20 23:43:48,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {2003#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {2003#true} is VALID [2022-02-20 23:43:48,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {2003#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {2003#true} is VALID [2022-02-20 23:43:48,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {2003#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {2003#true} is VALID [2022-02-20 23:43:48,622 INFO L272 TraceCheckUtils]: 11: Hoare triple {2003#true} call assume_abort_if_not(main_#t~ret14#1); {2003#true} is VALID [2022-02-20 23:43:48,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {2003#true} ~cond := #in~cond; {2003#true} is VALID [2022-02-20 23:43:48,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {2003#true} assume !(0 == ~cond); {2003#true} is VALID [2022-02-20 23:43:48,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-02-20 23:43:48,622 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2003#true} {2003#true} #191#return; {2003#true} is VALID [2022-02-20 23:43:48,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {2003#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2003#true} is VALID [2022-02-20 23:43:48,623 INFO L272 TraceCheckUtils]: 17: Hoare triple {2003#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2022#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:48,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {2022#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2003#true} is VALID [2022-02-20 23:43:48,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-02-20 23:43:48,624 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2003#true} {2003#true} #193#return; {2003#true} is VALID [2022-02-20 23:43:48,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {2003#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2016#(and (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc16#1.base|) (* |ULTIMATE.start_main_~n~0#1| 4)))} is VALID [2022-02-20 23:43:48,626 INFO L272 TraceCheckUtils]: 22: Hoare triple {2016#(and (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc16#1.base|) (* |ULTIMATE.start_main_~n~0#1| 4)))} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2022#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:48,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {2022#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2003#true} is VALID [2022-02-20 23:43:48,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {2003#true} assume true; {2003#true} is VALID [2022-02-20 23:43:48,627 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2003#true} {2016#(and (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc16#1.base|) (* |ULTIMATE.start_main_~n~0#1| 4)))} #195#return; {2016#(and (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc16#1.base|) (* |ULTIMATE.start_main_~n~0#1| 4)))} is VALID [2022-02-20 23:43:48,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {2016#(and (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc16#1.base|) (* |ULTIMATE.start_main_~n~0#1| 4)))} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {2020#(and (= |ULTIMATE.start_main_~a0~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (+ (* |ULTIMATE.start_main_~n~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~a0~0#1.base|))) 0))} is VALID [2022-02-20 23:43:48,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {2020#(and (= |ULTIMATE.start_main_~a0~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= (+ (* |ULTIMATE.start_main_~n~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~a0~0#1.base|))) 0))} assume !!(main_~i~1#1 < main_~n~0#1); {2021#(and (= |ULTIMATE.start_main_~a0~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a0~0#1.base|)))} is VALID [2022-02-20 23:43:48,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {2021#(and (= |ULTIMATE.start_main_~a0~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a0~0#1.base|)))} SUMMARY for call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L70 {2021#(and (= |ULTIMATE.start_main_~a0~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a0~0#1.base|)))} is VALID [2022-02-20 23:43:48,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {2021#(and (= |ULTIMATE.start_main_~a0~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a0~0#1.base|)))} assume !(4 + (main_~a0~0#1.offset + 4 * main_~i~1#1) <= #length[main_~a0~0#1.base] && 0 <= main_~a0~0#1.offset + 4 * main_~i~1#1); {2004#false} is VALID [2022-02-20 23:43:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:43:48,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:48,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027472265] [2022-02-20 23:43:48,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027472265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:48,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:48,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:43:48,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175318967] [2022-02-20 23:43:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:48,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-02-20 23:43:48,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:48,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:48,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:48,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:43:48,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:43:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:43:48,651 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,604 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2022-02-20 23:43:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:43:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-02-20 23:43:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2022-02-20 23:43:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2022-02-20 23:43:51,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 184 transitions. [2022-02-20 23:43:51,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,762 INFO L225 Difference]: With dead ends: 169 [2022-02-20 23:43:51,762 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:43:51,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:43:51,763 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 241 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:51,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 234 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:43:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:43:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 136. [2022-02-20 23:43:51,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:51,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 136 states, 100 states have (on average 1.66) internal successors, (166), 129 states have internal predecessors, (166), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:51,768 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 136 states, 100 states have (on average 1.66) internal successors, (166), 129 states have internal predecessors, (166), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:51,768 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 136 states, 100 states have (on average 1.66) internal successors, (166), 129 states have internal predecessors, (166), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,771 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2022-02-20 23:43:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2022-02-20 23:43:51,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 100 states have (on average 1.66) internal successors, (166), 129 states have internal predecessors, (166), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 169 states. [2022-02-20 23:43:51,772 INFO L87 Difference]: Start difference. First operand has 136 states, 100 states have (on average 1.66) internal successors, (166), 129 states have internal predecessors, (166), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 169 states. [2022-02-20 23:43:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,775 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2022-02-20 23:43:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2022-02-20 23:43:51,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:51,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 100 states have (on average 1.66) internal successors, (166), 129 states have internal predecessors, (166), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2022-02-20 23:43:51,778 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 30 [2022-02-20 23:43:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:51,778 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2022-02-20 23:43:51,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:43:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-02-20 23:43:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:43:51,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:51,779 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:51,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:43:51,779 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:43:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash -535927024, now seen corresponding path program 1 times [2022-02-20 23:43:51,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:51,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117033926] [2022-02-20 23:43:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:43:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-02-20 23:43:51,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-02-20 23:43:51,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 23:43:51,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #189#return; {2672#true} is VALID [2022-02-20 23:43:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:43:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-02-20 23:43:51,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-02-20 23:43:51,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 23:43:51,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #191#return; {2672#true} is VALID [2022-02-20 23:43:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:43:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {2692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2672#true} is VALID [2022-02-20 23:43:51,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 23:43:51,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2672#true} {2672#true} #193#return; {2672#true} is VALID [2022-02-20 23:43:51,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:43:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {2692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2672#true} is VALID [2022-02-20 23:43:51,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 23:43:51,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2672#true} {2672#true} #195#return; {2672#true} is VALID [2022-02-20 23:43:51,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {2672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2672#true} is VALID [2022-02-20 23:43:51,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2672#true} is VALID [2022-02-20 23:43:51,861 INFO L272 TraceCheckUtils]: 2: Hoare triple {2672#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {2672#true} is VALID [2022-02-20 23:43:51,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-02-20 23:43:51,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-02-20 23:43:51,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 23:43:51,861 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2672#true} {2672#true} #189#return; {2672#true} is VALID [2022-02-20 23:43:51,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {2678#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:43:51,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {2678#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {2678#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:43:51,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {2678#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {2672#true} is VALID [2022-02-20 23:43:51,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {2672#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {2672#true} is VALID [2022-02-20 23:43:51,862 INFO L272 TraceCheckUtils]: 11: Hoare triple {2672#true} call assume_abort_if_not(main_#t~ret14#1); {2672#true} is VALID [2022-02-20 23:43:51,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-02-20 23:43:51,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-02-20 23:43:51,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 23:43:51,863 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2672#true} {2672#true} #191#return; {2672#true} is VALID [2022-02-20 23:43:51,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2672#true} is VALID [2022-02-20 23:43:51,864 INFO L272 TraceCheckUtils]: 17: Hoare triple {2672#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2692#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:51,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {2692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2672#true} is VALID [2022-02-20 23:43:51,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 23:43:51,864 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2672#true} {2672#true} #193#return; {2672#true} is VALID [2022-02-20 23:43:51,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {2672#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2672#true} is VALID [2022-02-20 23:43:51,865 INFO L272 TraceCheckUtils]: 22: Hoare triple {2672#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2692#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:51,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {2692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2672#true} is VALID [2022-02-20 23:43:51,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-02-20 23:43:51,872 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2672#true} {2672#true} #195#return; {2672#true} is VALID [2022-02-20 23:43:51,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {2672#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {2689#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 23:43:51,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {2689#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_~i~1#1 < main_~n~0#1); {2690#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 23:43:51,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {2690#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {2691#(and (= (+ (- 1) |ULTIMATE.start_upsweep_~space~0#1|) 0) (<= |ULTIMATE.start_upsweep_~n#1| 0))} is VALID [2022-02-20 23:43:51,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {2691#(and (= (+ (- 1) |ULTIMATE.start_upsweep_~space~0#1|) 0) (<= |ULTIMATE.start_upsweep_~n#1| 0))} assume !!(upsweep_~space~0#1 < upsweep_~n#1);upsweep_~left~0#1 := upsweep_~space~0#1 - 1; {2673#false} is VALID [2022-02-20 23:43:51,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {2673#false} assume !!(upsweep_~left~0#1 < upsweep_~n#1);upsweep_~right~0#1 := upsweep_~left~0#1 + upsweep_~space~0#1; {2673#false} is VALID [2022-02-20 23:43:51,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {2673#false} assume !(1 == #valid[upsweep_~a#1.base]); {2673#false} is VALID [2022-02-20 23:43:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:43:51,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:51,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117033926] [2022-02-20 23:43:51,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117033926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:51,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:51,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:43:51,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918704344] [2022-02-20 23:43:51,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-02-20 23:43:51,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:51,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:43:51,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:43:51,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:51,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:43:51,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:51,894 INFO L87 Difference]: Start difference. First operand 136 states and 174 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:43:53,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 23:43:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,130 INFO L93 Difference]: Finished difference Result 303 states and 326 transitions. [2022-02-20 23:43:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:43:55,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-02-20 23:43:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:43:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 328 transitions. [2022-02-20 23:43:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:43:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 328 transitions. [2022-02-20 23:43:55,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 328 transitions. [2022-02-20 23:43:55,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:55,358 INFO L225 Difference]: With dead ends: 303 [2022-02-20 23:43:55,358 INFO L226 Difference]: Without dead ends: 303 [2022-02-20 23:43:55,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:43:55,358 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 330 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:55,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 846 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 23:43:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-02-20 23:43:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 130. [2022-02-20 23:43:55,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:55,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 130 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 123 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:55,369 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 130 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 123 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:55,369 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 130 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 123 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,382 INFO L93 Difference]: Finished difference Result 303 states and 326 transitions. [2022-02-20 23:43:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 326 transitions. [2022-02-20 23:43:55,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 123 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 303 states. [2022-02-20 23:43:55,384 INFO L87 Difference]: Start difference. First operand has 130 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 123 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 303 states. [2022-02-20 23:43:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,390 INFO L93 Difference]: Finished difference Result 303 states and 326 transitions. [2022-02-20 23:43:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 326 transitions. [2022-02-20 23:43:55,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:55,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 123 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:43:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 160 transitions. [2022-02-20 23:43:55,393 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 160 transitions. Word has length 32 [2022-02-20 23:43:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:55,393 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 160 transitions. [2022-02-20 23:43:55,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 23:43:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 160 transitions. [2022-02-20 23:43:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:43:55,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:55,394 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:55,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:43:55,394 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:43:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 566089799, now seen corresponding path program 1 times [2022-02-20 23:43:55,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:55,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791445471] [2022-02-20 23:43:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:43:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-02-20 23:43:55,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-02-20 23:43:55,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-02-20 23:43:55,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #189#return; {3744#true} is VALID [2022-02-20 23:43:55,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:43:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-02-20 23:43:55,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-02-20 23:43:55,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-02-20 23:43:55,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #191#return; {3744#true} is VALID [2022-02-20 23:43:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:43:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {3763#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3744#true} is VALID [2022-02-20 23:43:55,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-02-20 23:43:55,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3744#true} {3754#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} #193#return; {3754#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} is VALID [2022-02-20 23:43:55,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:43:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {3763#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3744#true} is VALID [2022-02-20 23:43:55,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-02-20 23:43:55,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3744#true} {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} #195#return; {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {3744#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3744#true} is VALID [2022-02-20 23:43:55,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {3744#true} is VALID [2022-02-20 23:43:55,458 INFO L272 TraceCheckUtils]: 2: Hoare triple {3744#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {3744#true} is VALID [2022-02-20 23:43:55,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-02-20 23:43:55,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-02-20 23:43:55,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-02-20 23:43:55,458 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3744#true} {3744#true} #189#return; {3744#true} is VALID [2022-02-20 23:43:55,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {3744#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {3744#true} is VALID [2022-02-20 23:43:55,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {3744#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {3744#true} is VALID [2022-02-20 23:43:55,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {3744#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {3744#true} is VALID [2022-02-20 23:43:55,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {3744#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {3744#true} is VALID [2022-02-20 23:43:55,459 INFO L272 TraceCheckUtils]: 11: Hoare triple {3744#true} call assume_abort_if_not(main_#t~ret14#1); {3744#true} is VALID [2022-02-20 23:43:55,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-02-20 23:43:55,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-02-20 23:43:55,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-02-20 23:43:55,460 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3744#true} {3744#true} #191#return; {3744#true} is VALID [2022-02-20 23:43:55,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {3744#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {3754#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} is VALID [2022-02-20 23:43:55,461 INFO L272 TraceCheckUtils]: 17: Hoare triple {3754#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {3763#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:55,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {3763#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3744#true} is VALID [2022-02-20 23:43:55,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-02-20 23:43:55,462 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3744#true} {3754#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} #193#return; {3754#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} is VALID [2022-02-20 23:43:55,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {3754#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,463 INFO L272 TraceCheckUtils]: 22: Hoare triple {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {3763#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:43:55,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {3763#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3744#true} is VALID [2022-02-20 23:43:55,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-02-20 23:43:55,464 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3744#true} {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} #195#return; {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !(main_~i~1#1 < main_~n~0#1); {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !(upsweep_~space~0#1 < upsweep_~n#1); {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} upsweep_#res#1 := upsweep_~space~0#1; {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {3758#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1; {3762#(= (select |#valid| |ULTIMATE.start_downsweep_~a#1.base|) 1)} is VALID [2022-02-20 23:43:55,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {3762#(= (select |#valid| |ULTIMATE.start_downsweep_~a#1.base|) 1)} assume !(1 == #valid[downsweep_~a#1.base]); {3745#false} is VALID [2022-02-20 23:43:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:43:55,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:55,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791445471] [2022-02-20 23:43:55,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791445471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:55,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:55,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:43:55,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126740964] [2022-02-20 23:43:55,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-02-20 23:43:55,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:55,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:43:55,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:55,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:43:55,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:43:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:43:55,491 INFO L87 Difference]: Start difference. First operand 130 states and 160 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:04,433 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-02-20 23:44:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:04,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-02-20 23:44:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-02-20 23:44:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-02-20 23:44:04,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-02-20 23:44:04,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:04,509 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:44:04,509 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:44:04,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:44:04,510 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 175 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:04,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 172 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:44:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-02-20 23:44:04,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:04,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 117 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:44:04,513 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 117 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:44:04,513 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 117 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:44:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:04,515 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-02-20 23:44:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2022-02-20 23:44:04,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:04,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:04,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 117 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 124 states. [2022-02-20 23:44:04,516 INFO L87 Difference]: Start difference. First operand has 124 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 117 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 124 states. [2022-02-20 23:44:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:04,519 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-02-20 23:44:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2022-02-20 23:44:04,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:04,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:04,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:04,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 117 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:44:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2022-02-20 23:44:04,522 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 33 [2022-02-20 23:44:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:04,522 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2022-02-20 23:44:04,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2022-02-20 23:44:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:44:04,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:04,523 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:04,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:44:04,523 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:44:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 566089800, now seen corresponding path program 1 times [2022-02-20 23:44:04,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:04,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607673660] [2022-02-20 23:44:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:04,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:44:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:04,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {4266#true} ~cond := #in~cond; {4266#true} is VALID [2022-02-20 23:44:04,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume !(0 == ~cond); {4266#true} is VALID [2022-02-20 23:44:04,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-02-20 23:44:04,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4266#true} {4268#(<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648))} #189#return; {4268#(<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648))} is VALID [2022-02-20 23:44:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:44:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:04,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {4266#true} ~cond := #in~cond; {4288#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 23:44:04,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {4288#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4289#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 23:44:04,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {4289#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4289#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 23:44:04,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4289#(not (= |assume_abort_if_not_#in~cond| 0))} {4275#(or (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_#t~ret14#1| 0))} #191#return; {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:44:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:04,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {4290#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4266#true} is VALID [2022-02-20 23:44:04,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-02-20 23:44:04,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4266#true} {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} #193#return; {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:04,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:44:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:04,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {4290#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4266#true} is VALID [2022-02-20 23:44:04,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-02-20 23:44:04,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4266#true} {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} #195#return; {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:04,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {4266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4266#true} is VALID [2022-02-20 23:44:04,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {4268#(<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648))} is VALID [2022-02-20 23:44:04,699 INFO L272 TraceCheckUtils]: 2: Hoare triple {4268#(<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648))} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {4266#true} is VALID [2022-02-20 23:44:04,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {4266#true} ~cond := #in~cond; {4266#true} is VALID [2022-02-20 23:44:04,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {4266#true} assume !(0 == ~cond); {4266#true} is VALID [2022-02-20 23:44:04,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-02-20 23:44:04,702 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4266#true} {4268#(<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648))} #189#return; {4268#(<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648))} is VALID [2022-02-20 23:44:04,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {4268#(<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648))} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {4273#(and (= (+ |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_is_pow2_~x#1| (- 1))) 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))} is VALID [2022-02-20 23:44:04,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {4273#(and (= (+ |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_is_pow2_~x#1| (- 1))) 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {4273#(and (= (+ |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_is_pow2_~x#1| (- 1))) 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))} is VALID [2022-02-20 23:44:04,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {4273#(and (= (+ |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_is_pow2_~x#1| (- 1))) 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {4274#(or (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_is_pow2_#res#1| 0))} is VALID [2022-02-20 23:44:04,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {4274#(or (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_is_pow2_#res#1| 0))} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {4275#(or (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_#t~ret14#1| 0))} is VALID [2022-02-20 23:44:04,704 INFO L272 TraceCheckUtils]: 11: Hoare triple {4275#(or (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_#t~ret14#1| 0))} call assume_abort_if_not(main_#t~ret14#1); {4266#true} is VALID [2022-02-20 23:44:04,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {4266#true} ~cond := #in~cond; {4288#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 23:44:04,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {4288#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4289#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 23:44:04,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {4289#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4289#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 23:44:04,706 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4289#(not (= |assume_abort_if_not_#in~cond| 0))} {4275#(or (<= 1 |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_#t~ret14#1| 0))} #191#return; {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:04,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:04,707 INFO L272 TraceCheckUtils]: 17: Hoare triple {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {4290#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:44:04,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {4290#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4266#true} is VALID [2022-02-20 23:44:04,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-02-20 23:44:04,708 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4266#true} {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} #193#return; {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:04,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:04,709 INFO L272 TraceCheckUtils]: 22: Hoare triple {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {4290#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:44:04,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {4290#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4266#true} is VALID [2022-02-20 23:44:04,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-02-20 23:44:04,710 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4266#true} {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} #195#return; {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:04,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {4280#(<= 1 |ULTIMATE.start_main_~n~0#1|)} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {4287#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:44:04,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {4287#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~1#1 < main_~n~0#1); {4267#false} is VALID [2022-02-20 23:44:04,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {4267#false} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {4267#false} is VALID [2022-02-20 23:44:04,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {4267#false} assume !(upsweep_~space~0#1 < upsweep_~n#1); {4267#false} is VALID [2022-02-20 23:44:04,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {4267#false} upsweep_#res#1 := upsweep_~space~0#1; {4267#false} is VALID [2022-02-20 23:44:04,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {4267#false} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1; {4267#false} is VALID [2022-02-20 23:44:04,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {4267#false} assume !(4 + (downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1)) <= #length[downsweep_~a#1.base] && 0 <= downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1)); {4267#false} is VALID [2022-02-20 23:44:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:44:04,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:04,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607673660] [2022-02-20 23:44:04,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607673660] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:04,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:04,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:44:04,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003692757] [2022-02-20 23:44:04,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-02-20 23:44:04,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:04,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:04,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:04,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:44:04,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:44:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:44:04,736 INFO L87 Difference]: Start difference. First operand 124 states and 148 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:08,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 23:44:11,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 23:44:13,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 23:44:15,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 23:44:17,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 23:44:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:27,319 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2022-02-20 23:44:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:44:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-02-20 23:44:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-02-20 23:44:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-02-20 23:44:27,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 192 transitions. [2022-02-20 23:44:27,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:27,458 INFO L225 Difference]: With dead ends: 208 [2022-02-20 23:44:27,458 INFO L226 Difference]: Without dead ends: 208 [2022-02-20 23:44:27,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:44:27,460 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 410 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:27,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 950 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-02-20 23:44:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-20 23:44:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 134. [2022-02-20 23:44:27,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:27,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 134 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 124 states have internal predecessors, (148), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:44:27,475 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 134 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 124 states have internal predecessors, (148), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:44:27,476 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 134 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 124 states have internal predecessors, (148), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:44:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:27,479 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2022-02-20 23:44:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2022-02-20 23:44:27,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:27,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:27,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 124 states have internal predecessors, (148), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 208 states. [2022-02-20 23:44:27,481 INFO L87 Difference]: Start difference. First operand has 134 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 124 states have internal predecessors, (148), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 208 states. [2022-02-20 23:44:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:27,484 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2022-02-20 23:44:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2022-02-20 23:44:27,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:27,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:27,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:27,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 124 states have internal predecessors, (148), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:44:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2022-02-20 23:44:27,492 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 33 [2022-02-20 23:44:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:27,493 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2022-02-20 23:44:27,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:44:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2022-02-20 23:44:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:44:27,494 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:27,494 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:27,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:44:27,495 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:44:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1785256912, now seen corresponding path program 1 times [2022-02-20 23:44:27,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:27,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838200320] [2022-02-20 23:44:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:44:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {5063#true} ~cond := #in~cond; {5063#true} is VALID [2022-02-20 23:44:27,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {5063#true} assume !(0 == ~cond); {5063#true} is VALID [2022-02-20 23:44:27,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:27,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5063#true} {5063#true} #189#return; {5063#true} is VALID [2022-02-20 23:44:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:44:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {5063#true} ~cond := #in~cond; {5063#true} is VALID [2022-02-20 23:44:27,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {5063#true} assume !(0 == ~cond); {5063#true} is VALID [2022-02-20 23:44:27,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:27,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5063#true} {5063#true} #191#return; {5063#true} is VALID [2022-02-20 23:44:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 23:44:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {5084#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5063#true} is VALID [2022-02-20 23:44:27,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:27,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5063#true} {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} #193#return; {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} is VALID [2022-02-20 23:44:27,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 23:44:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {5084#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5063#true} is VALID [2022-02-20 23:44:27,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:27,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5063#true} {5077#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} #195#return; {5077#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {5063#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5063#true} is VALID [2022-02-20 23:44:27,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {5063#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {5063#true} is VALID [2022-02-20 23:44:27,707 INFO L272 TraceCheckUtils]: 2: Hoare triple {5063#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {5063#true} is VALID [2022-02-20 23:44:27,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {5063#true} ~cond := #in~cond; {5063#true} is VALID [2022-02-20 23:44:27,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {5063#true} assume !(0 == ~cond); {5063#true} is VALID [2022-02-20 23:44:27,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:27,707 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5063#true} {5063#true} #189#return; {5063#true} is VALID [2022-02-20 23:44:27,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {5063#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {5063#true} is VALID [2022-02-20 23:44:27,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {5063#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {5063#true} is VALID [2022-02-20 23:44:27,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {5063#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {5063#true} is VALID [2022-02-20 23:44:27,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {5063#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {5063#true} is VALID [2022-02-20 23:44:27,708 INFO L272 TraceCheckUtils]: 11: Hoare triple {5063#true} call assume_abort_if_not(main_#t~ret14#1); {5063#true} is VALID [2022-02-20 23:44:27,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {5063#true} ~cond := #in~cond; {5063#true} is VALID [2022-02-20 23:44:27,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {5063#true} assume !(0 == ~cond); {5063#true} is VALID [2022-02-20 23:44:27,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:27,709 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5063#true} {5063#true} #191#return; {5063#true} is VALID [2022-02-20 23:44:27,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {5063#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} is VALID [2022-02-20 23:44:27,714 INFO L272 TraceCheckUtils]: 17: Hoare triple {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {5084#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:44:27,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {5084#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5063#true} is VALID [2022-02-20 23:44:27,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:27,715 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5063#true} {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} #193#return; {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} is VALID [2022-02-20 23:44:27,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {5077#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,717 INFO L272 TraceCheckUtils]: 22: Hoare triple {5077#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {5084#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:44:27,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {5084#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5063#true} is VALID [2022-02-20 23:44:27,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:27,718 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5063#true} {5077#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} #195#return; {5077#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {5077#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~1#1 < main_~n~0#1); {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} SUMMARY for call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L70 {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} SUMMARY for call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L70-1 {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} havoc main_#t~mem18#1; {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {5081#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {5082#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:44:27,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {5082#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(main_~i~1#1 < main_~n~0#1); {5083#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:27,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {5083#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(4 + (main_~a~0#1.offset + 4 * main_~i~1#1) <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset + 4 * main_~i~1#1); {5064#false} is VALID [2022-02-20 23:44:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:44:27,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:27,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838200320] [2022-02-20 23:44:27,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838200320] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:27,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171144692] [2022-02-20 23:44:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:27,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:27,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:27,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:44:27,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:44:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:44:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:27,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:27,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:44:27,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:44:28,109 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:44:28,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-20 23:44:28,155 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:44:28,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:44:28,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {5063#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5063#true} is VALID [2022-02-20 23:44:28,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {5063#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {5063#true} is VALID [2022-02-20 23:44:28,357 INFO L272 TraceCheckUtils]: 2: Hoare triple {5063#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {5063#true} is VALID [2022-02-20 23:44:28,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {5063#true} ~cond := #in~cond; {5063#true} is VALID [2022-02-20 23:44:28,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {5063#true} assume !(0 == ~cond); {5063#true} is VALID [2022-02-20 23:44:28,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5063#true} {5063#true} #189#return; {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {5063#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {5063#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {5063#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {5063#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L272 TraceCheckUtils]: 11: Hoare triple {5063#true} call assume_abort_if_not(main_#t~ret14#1); {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {5063#true} ~cond := #in~cond; {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {5063#true} assume !(0 == ~cond); {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:28,358 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5063#true} {5063#true} #191#return; {5063#true} is VALID [2022-02-20 23:44:28,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {5063#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} is VALID [2022-02-20 23:44:28,360 INFO L272 TraceCheckUtils]: 17: Hoare triple {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {5139#(exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))} is VALID [2022-02-20 23:44:28,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {5139#(exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5139#(exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))} is VALID [2022-02-20 23:44:28,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {5139#(exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))} assume true; {5139#(exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))} is VALID [2022-02-20 23:44:28,362 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5139#(exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))} {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} #193#return; {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} is VALID [2022-02-20 23:44:28,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {5073#(and (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0))} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {5152#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:28,363 INFO L272 TraceCheckUtils]: 22: Hoare triple {5152#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {5063#true} is VALID [2022-02-20 23:44:28,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {5063#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5063#true} is VALID [2022-02-20 23:44:28,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {5063#true} assume true; {5063#true} is VALID [2022-02-20 23:44:28,364 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5063#true} {5152#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} #195#return; {5152#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:28,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {5152#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:28,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~1#1 < main_~n~0#1); {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:28,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} SUMMARY for call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L70 {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:28,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} SUMMARY for call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4); srcloc: L70-1 {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:28,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} havoc main_#t~mem18#1; {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:28,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {5168#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {5082#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-20 23:44:28,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {5082#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~n~0#1| 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~1#1|))} assume !!(main_~i~1#1 < main_~n~0#1); {5083#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 23:44:28,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {5083#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(4 + (main_~a~0#1.offset + 4 * main_~i~1#1) <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset + 4 * main_~i~1#1); {5064#false} is VALID [2022-02-20 23:44:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:44:28,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:29,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171144692] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:29,005 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:44:29,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 23:44:29,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905858165] [2022-02-20 23:44:29,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:29,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2022-02-20 23:44:29,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:29,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:44:29,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:29,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:44:29,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:29,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:44:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:44:29,041 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:44:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,765 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2022-02-20 23:44:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:44:40,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2022-02-20 23:44:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:44:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2022-02-20 23:44:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:44:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2022-02-20 23:44:40,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 158 transitions. [2022-02-20 23:44:40,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:40,891 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:44:40,891 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:44:40,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:44:40,900 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 395 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:40,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 392 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 88 Unchecked, 0.3s Time] [2022-02-20 23:44:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:44:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 136. [2022-02-20 23:44:40,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:40,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 125 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:44:40,904 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 125 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:44:40,905 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 125 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:44:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,907 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2022-02-20 23:44:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2022-02-20 23:44:40,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 125 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 157 states. [2022-02-20 23:44:40,911 INFO L87 Difference]: Start difference. First operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 125 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 157 states. [2022-02-20 23:44:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,913 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2022-02-20 23:44:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2022-02-20 23:44:40,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:40,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 125 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 23:44:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 163 transitions. [2022-02-20 23:44:40,919 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 163 transitions. Word has length 34 [2022-02-20 23:44:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:40,919 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 163 transitions. [2022-02-20 23:44:40,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:44:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 163 transitions. [2022-02-20 23:44:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:44:40,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:40,920 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:40,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:44:41,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:41,129 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2022-02-20 23:44:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash 661582495, now seen corresponding path program 1 times [2022-02-20 23:44:41,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:41,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534152963] [2022-02-20 23:44:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:41,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 23:44:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {5851#true} ~cond := #in~cond; {5871#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 23:44:41,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {5871#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5872#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 23:44:41,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {5872#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5872#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 23:44:41,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5872#(not (= |assume_abort_if_not_#in~cond| 0))} {5851#true} #189#return; {5857#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 23:44:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {5851#true} ~cond := #in~cond; {5851#true} is VALID [2022-02-20 23:44:41,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {5851#true} assume !(0 == ~cond); {5851#true} is VALID [2022-02-20 23:44:41,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {5851#true} assume true; {5851#true} is VALID [2022-02-20 23:44:41,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5851#true} {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} #191#return; {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 23:44:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {5873#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5851#true} is VALID [2022-02-20 23:44:41,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {5851#true} assume true; {5851#true} is VALID [2022-02-20 23:44:41,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5851#true} {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} #193#return; {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:41,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 23:44:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {5873#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5851#true} is VALID [2022-02-20 23:44:41,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {5851#true} assume true; {5851#true} is VALID [2022-02-20 23:44:41,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5851#true} {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} #195#return; {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:41,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {5851#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5851#true} is VALID [2022-02-20 23:44:41,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {5851#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {5851#true} is VALID [2022-02-20 23:44:41,342 INFO L272 TraceCheckUtils]: 2: Hoare triple {5851#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {5851#true} is VALID [2022-02-20 23:44:41,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {5851#true} ~cond := #in~cond; {5871#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 23:44:41,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {5871#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5872#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 23:44:41,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {5872#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5872#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 23:44:41,344 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5872#(not (= |assume_abort_if_not_#in~cond| 0))} {5851#true} #189#return; {5857#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:41,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {5857#(<= 0 |ULTIMATE.start_main_~n~0#1|)} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {5858#(and (= (+ |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_is_pow2_~x#1| (- 1))) 0) (<= 0 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:44:43,483 WARN L290 TraceCheckUtils]: 8: Hoare triple {5858#(and (= (+ |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_is_pow2_~x#1| (- 1))) 0) (<= 0 |ULTIMATE.start_main_~n~0#1|))} assume !!(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1);is_pow2_~x#1 := (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then 1 + is_pow2_~x#1 % 4294967296 / 2 else is_pow2_~x#1 % 4294967296 / 2); {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is UNKNOWN [2022-02-20 23:44:43,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:43,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:43,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:43,484 INFO L272 TraceCheckUtils]: 12: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} call assume_abort_if_not(main_#t~ret14#1); {5851#true} is VALID [2022-02-20 23:44:43,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {5851#true} ~cond := #in~cond; {5851#true} is VALID [2022-02-20 23:44:43,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {5851#true} assume !(0 == ~cond); {5851#true} is VALID [2022-02-20 23:44:43,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {5851#true} assume true; {5851#true} is VALID [2022-02-20 23:44:43,485 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5851#true} {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} #191#return; {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:43,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:43,486 INFO L272 TraceCheckUtils]: 18: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {5873#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:44:43,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {5873#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5851#true} is VALID [2022-02-20 23:44:43,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {5851#true} assume true; {5851#true} is VALID [2022-02-20 23:44:43,490 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5851#true} {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} #193#return; {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:43,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:43,492 INFO L272 TraceCheckUtils]: 23: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {5873#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 23:44:43,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {5873#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5851#true} is VALID [2022-02-20 23:44:43,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {5851#true} assume true; {5851#true} is VALID [2022-02-20 23:44:43,492 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5851#true} {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} #195#return; {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 23:44:43,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {5859#(<= 2 |ULTIMATE.start_main_~n~0#1|)} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {5870#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 2 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 23:44:43,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {5870#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 2 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~1#1 < main_~n~0#1); {5852#false} is VALID [2022-02-20 23:44:43,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {5852#false} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {5852#false} is VALID [2022-02-20 23:44:43,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {5852#false} assume !(upsweep_~space~0#1 < upsweep_~n#1); {5852#false} is VALID [2022-02-20 23:44:43,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {5852#false} upsweep_#res#1 := upsweep_~space~0#1; {5852#false} is VALID [2022-02-20 23:44:43,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {5852#false} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1; {5852#false} is VALID [2022-02-20 23:44:43,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {5852#false} assume !(4 + (downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1)) <= #length[downsweep_~a#1.base] && 0 <= downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1)); {5852#false} is VALID [2022-02-20 23:44:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:44:43,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:43,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534152963] [2022-02-20 23:44:43,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534152963] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:43,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977644372] [2022-02-20 23:44:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:43,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:43,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:43,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:44:43,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process