./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe010_tso.oepc.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe010_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 475f26e84af8b6b210cc56db324a2381e5b2f7e1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 21:32:28,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 21:32:28,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 21:32:28,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 21:32:28,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 21:32:28,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 21:32:28,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 21:32:28,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 21:32:28,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 21:32:28,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 21:32:28,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 21:32:28,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 21:32:28,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 21:32:28,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 21:32:28,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 21:32:28,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 21:32:28,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 21:32:28,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 21:32:28,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 21:32:28,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 21:32:28,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 21:32:28,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 21:32:28,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 21:32:28,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 21:32:28,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 21:32:28,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 21:32:28,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 21:32:28,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 21:32:28,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 21:32:28,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 21:32:28,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 21:32:28,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 21:32:28,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 21:32:28,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 21:32:28,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 21:32:28,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 21:32:28,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 21:32:28,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 21:32:28,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 21:32:28,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 21:32:28,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 21:32:28,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 21:32:28,801 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 21:32:28,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 21:32:28,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 21:32:28,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 21:32:28,804 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 21:32:28,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 21:32:28,804 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 21:32:28,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 21:32:28,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 21:32:28,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 21:32:28,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 21:32:28,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 21:32:28,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 21:32:28,806 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 21:32:28,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 21:32:28,807 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 21:32:28,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 21:32:28,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 21:32:28,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 21:32:28,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 21:32:28,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 21:32:28,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 21:32:28,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 21:32:28,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 21:32:28,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 21:32:28,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 21:32:28,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 21:32:28,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 21:32:28,810 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 21:32:28,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 475f26e84af8b6b210cc56db324a2381e5b2f7e1 [2020-07-28 21:32:29,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 21:32:29,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 21:32:29,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 21:32:29,154 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 21:32:29,156 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 21:32:29,157 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe010_tso.oepc.i [2020-07-28 21:32:29,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6272e63ab/793f2997ee2d480da72389b24243f2c9/FLAGf8a2c2393 [2020-07-28 21:32:29,808 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 21:32:29,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe010_tso.oepc.i [2020-07-28 21:32:29,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6272e63ab/793f2997ee2d480da72389b24243f2c9/FLAGf8a2c2393 [2020-07-28 21:32:30,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6272e63ab/793f2997ee2d480da72389b24243f2c9 [2020-07-28 21:32:30,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 21:32:30,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 21:32:30,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 21:32:30,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 21:32:30,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 21:32:30,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e35998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30, skipping insertion in model container [2020-07-28 21:32:30,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 21:32:30,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 21:32:30,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:32:30,634 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 21:32:30,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:32:30,768 INFO L208 MainTranslator]: Completed translation [2020-07-28 21:32:30,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30 WrapperNode [2020-07-28 21:32:30,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 21:32:30,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 21:32:30,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 21:32:30,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 21:32:30,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 21:32:30,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 21:32:30,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 21:32:30,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 21:32:30,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... [2020-07-28 21:32:30,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 21:32:30,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 21:32:30,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 21:32:30,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 21:32:30,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 21:32:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 21:32:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-07-28 21:32:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 21:32:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 21:32:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-07-28 21:32:30,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-07-28 21:32:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-07-28 21:32:30,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-07-28 21:32:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-07-28 21:32:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 21:32:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 21:32:30,930 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-07-28 21:32:31,290 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 21:32:31,291 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 21:32:31,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:32:31 BoogieIcfgContainer [2020-07-28 21:32:31,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 21:32:31,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 21:32:31,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 21:32:31,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 21:32:31,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 09:32:30" (1/3) ... [2020-07-28 21:32:31,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662e2e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:32:31, skipping insertion in model container [2020-07-28 21:32:31,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:32:30" (2/3) ... [2020-07-28 21:32:31,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662e2e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:32:31, skipping insertion in model container [2020-07-28 21:32:31,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:32:31" (3/3) ... [2020-07-28 21:32:31,304 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_tso.oepc.i [2020-07-28 21:32:31,316 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-07-28 21:32:31,316 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 21:32:31,324 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 21:32:31,325 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-07-28 21:32:31,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,369 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,369 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,381 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:32:31,399 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-28 21:32:31,422 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 21:32:31,422 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 21:32:31,423 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 21:32:31,423 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 21:32:31,423 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 21:32:31,423 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 21:32:31,424 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 21:32:31,424 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 21:32:31,440 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 55 transitions, 120 flow [2020-07-28 21:32:31,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 120 flow [2020-07-28 21:32:31,488 INFO L129 PetriNetUnfolder]: 2/53 cut-off events. [2020-07-28 21:32:31,488 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 21:32:31,493 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 53 events. 2/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-07-28 21:32:31,495 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 120 flow [2020-07-28 21:32:31,514 INFO L129 PetriNetUnfolder]: 2/53 cut-off events. [2020-07-28 21:32:31,515 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 21:32:31,516 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 53 events. 2/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-07-28 21:32:31,517 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 672 [2020-07-28 21:32:31,519 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-07-28 21:32:33,325 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-07-28 21:32:33,768 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1251 [2020-07-28 21:32:33,768 INFO L214 etLargeBlockEncoding]: Total number of compositions: 49 [2020-07-28 21:32:33,772 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 15 transitions, 40 flow [2020-07-28 21:32:33,786 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 74 states. [2020-07-28 21:32:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-28 21:32:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 21:32:33,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:32:33,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 21:32:33,797 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:32:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:32:33,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1814584925, now seen corresponding path program 1 times [2020-07-28 21:32:33,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:32:33,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013025895] [2020-07-28 21:32:33,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:32:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:32:34,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#true} [178] ULTIMATE.startENTRY-->L748: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2021~0.offset_14|) (= 0 v_~y~0_42) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x~0_25) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2021~0.base_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18|) |v_ULTIMATE.start_main_~#t2021~0.offset_14| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_58) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18|)) (= 0 |v_#NULL.offset_4|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~main$tmp_guard0~0_23) (= 0 v_~main$tmp_guard1~0_31) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2021~0.base_18| 4)) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_14|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_18|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2021~0.base=|v_ULTIMATE.start_main_~#t2021~0.base_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2021~0.offset=|v_ULTIMATE.start_main_~#t2021~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y~0=v_~y~0_42, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2021~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2021~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2022~0.base] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:32:34,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {213#(= 0 ~y~0)} [131] L748-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:32:34,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {213#(= 0 ~y~0)} [166] L748-1-->L750: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2022~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12|) |v_ULTIMATE.start_main_~#t2022~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2022~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2022~0.base_12|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2022~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_11|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2022~0.base] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:32:34,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {213#(= 0 ~y~0)} [133] L750-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:32:34,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {213#(= 0 ~y~0)} [165] L750-1-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_15 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_36))) (or (and (= 0 v_~main$tmp_guard0~0_15) (not .cse0)) (and (= 1 v_~main$tmp_guard0~0_15) .cse0)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:32:34,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {213#(= 0 ~y~0)} [177] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_28) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|) (= 1 v_~__unbuffered_p1_EAX~0_38) (= 2 v_~y~0_41) (= 0 v_~main$tmp_guard1~0_30) (= v_ULTIMATE.start_assume_abort_if_not_~cond_22 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_22))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y~0=v_~y~0_41} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_28, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y~0=v_~y~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {212#false} is VALID [2020-07-28 21:32:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:32:34,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013025895] [2020-07-28 21:32:34,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:32:34,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-28 21:32:34,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663801628] [2020-07-28 21:32:34,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-28 21:32:34,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:32:34,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 21:32:34,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:34,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 21:32:34,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:32:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 21:32:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:32:34,088 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-07-28 21:32:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,156 INFO L93 Difference]: Finished difference Result 72 states and 154 transitions. [2020-07-28 21:32:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 21:32:34,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-28 21:32:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:32:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:32:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2020-07-28 21:32:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:32:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2020-07-28 21:32:34,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2020-07-28 21:32:34,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:34,233 INFO L225 Difference]: With dead ends: 72 [2020-07-28 21:32:34,234 INFO L226 Difference]: Without dead ends: 56 [2020-07-28 21:32:34,235 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:32:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-28 21:32:34,269 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,270 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,271 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,271 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,271 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,271 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,272 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,272 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,272 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,272 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,273 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,273 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,273 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,273 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,274 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,274 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,274 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,275 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,275 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,275 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,275 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,276 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,276 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,276 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,276 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,277 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,277 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,277 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,277 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,278 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,278 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,278 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,278 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,279 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,279 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,279 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,279 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,280 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,280 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,280 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,280 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,281 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,281 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,281 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,282 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,282 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,282 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,282 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,283 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,283 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,283 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,283 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,284 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,284 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,284 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,284 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-28 21:32:34,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:32:34,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-28 21:32:34,287 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-28 21:32:34,287 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-28 21:32:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,294 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2020-07-28 21:32:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2020-07-28 21:32:34,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:34,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:34,295 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-28 21:32:34,296 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-28 21:32:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,302 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2020-07-28 21:32:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2020-07-28 21:32:34,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:34,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:34,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:32:34,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:32:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-28 21:32:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2020-07-28 21:32:34,310 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 6 [2020-07-28 21:32:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:32:34,311 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2020-07-28 21:32:34,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 21:32:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2020-07-28 21:32:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 21:32:34,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:32:34,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:32:34,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 21:32:34,313 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:32:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:32:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash 417556795, now seen corresponding path program 1 times [2020-07-28 21:32:34,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:32:34,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384225301] [2020-07-28 21:32:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:32:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:32:34,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} [178] ULTIMATE.startENTRY-->L748: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2021~0.offset_14|) (= 0 v_~y~0_42) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x~0_25) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2021~0.base_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18|) |v_ULTIMATE.start_main_~#t2021~0.offset_14| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_58) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18|)) (= 0 |v_#NULL.offset_4|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~main$tmp_guard0~0_23) (= 0 v_~main$tmp_guard1~0_31) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2021~0.base_18| 4)) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_14|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_18|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2021~0.base=|v_ULTIMATE.start_main_~#t2021~0.base_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2021~0.offset=|v_ULTIMATE.start_main_~#t2021~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y~0=v_~y~0_42, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2021~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2021~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2022~0.base] {514#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#(= 0 ~__unbuffered_p1_EAX~0)} [131] L748-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {514#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#(= 0 ~__unbuffered_p1_EAX~0)} [166] L748-1-->L750: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2022~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12|) |v_ULTIMATE.start_main_~#t2022~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2022~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2022~0.base_12|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2022~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_11|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2022~0.base] {514#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,414 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#(= 0 ~__unbuffered_p1_EAX~0)} [133] L750-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {514#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#(= 0 ~__unbuffered_p1_EAX~0)} [165] L750-1-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_15 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_36))) (or (and (= 0 v_~main$tmp_guard0~0_15) (not .cse0)) (and (= 1 v_~main$tmp_guard0~0_15) .cse0)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {514#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#(= 0 ~__unbuffered_p1_EAX~0)} [138] P0ENTRY-->L710: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~y~0_5) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_5, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {514#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {514#(= 0 ~__unbuffered_p1_EAX~0)} [177] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_28) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|) (= 1 v_~__unbuffered_p1_EAX~0_38) (= 2 v_~y~0_41) (= 0 v_~main$tmp_guard1~0_30) (= v_ULTIMATE.start_assume_abort_if_not_~cond_22 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_22))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y~0=v_~y~0_41} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_28, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y~0=v_~y~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {513#false} is VALID [2020-07-28 21:32:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:32:34,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384225301] [2020-07-28 21:32:34,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:32:34,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-28 21:32:34,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362135657] [2020-07-28 21:32:34,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 21:32:34,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:32:34,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 21:32:34,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:34,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 21:32:34,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:32:34,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 21:32:34,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:32:34,433 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 3 states. [2020-07-28 21:32:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,468 INFO L93 Difference]: Finished difference Result 53 states and 106 transitions. [2020-07-28 21:32:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 21:32:34,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 21:32:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:32:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:32:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-28 21:32:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:32:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-28 21:32:34,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2020-07-28 21:32:34,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:34,501 INFO L225 Difference]: With dead ends: 53 [2020-07-28 21:32:34,501 INFO L226 Difference]: Without dead ends: 53 [2020-07-28 21:32:34,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:32:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-28 21:32:34,507 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,507 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,507 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,508 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,508 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,508 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,508 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,509 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,509 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,509 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,509 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,520 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,520 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-28 21:32:34,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:32:34,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-28 21:32:34,521 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-28 21:32:34,521 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-28 21:32:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,525 INFO L93 Difference]: Finished difference Result 53 states and 106 transitions. [2020-07-28 21:32:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 106 transitions. [2020-07-28 21:32:34,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:34,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:34,526 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-28 21:32:34,526 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-28 21:32:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,530 INFO L93 Difference]: Finished difference Result 53 states and 106 transitions. [2020-07-28 21:32:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 106 transitions. [2020-07-28 21:32:34,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:34,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:34,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:32:34,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:32:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-28 21:32:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 106 transitions. [2020-07-28 21:32:34,535 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 106 transitions. Word has length 7 [2020-07-28 21:32:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:32:34,536 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 106 transitions. [2020-07-28 21:32:34,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 21:32:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 106 transitions. [2020-07-28 21:32:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 21:32:34,537 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:32:34,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:32:34,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 21:32:34,538 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:32:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:32:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash 58787852, now seen corresponding path program 1 times [2020-07-28 21:32:34,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:32:34,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524996119] [2020-07-28 21:32:34,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:32:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:32:34,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {782#true} [178] ULTIMATE.startENTRY-->L748: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2021~0.offset_14|) (= 0 v_~y~0_42) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x~0_25) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2021~0.base_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18|) |v_ULTIMATE.start_main_~#t2021~0.offset_14| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_58) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18|)) (= 0 |v_#NULL.offset_4|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~main$tmp_guard0~0_23) (= 0 v_~main$tmp_guard1~0_31) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2021~0.base_18| 4)) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_14|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_18|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2021~0.base=|v_ULTIMATE.start_main_~#t2021~0.base_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2021~0.offset=|v_ULTIMATE.start_main_~#t2021~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y~0=v_~y~0_42, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2021~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2021~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2022~0.base] {784#(= 0 ~x~0)} is VALID [2020-07-28 21:32:34,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {784#(= 0 ~x~0)} [131] L748-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {784#(= 0 ~x~0)} is VALID [2020-07-28 21:32:34,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {784#(= 0 ~x~0)} [166] L748-1-->L750: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2022~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12|) |v_ULTIMATE.start_main_~#t2022~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2022~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2022~0.base_12|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2022~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_11|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2022~0.base] {784#(= 0 ~x~0)} is VALID [2020-07-28 21:32:34,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {784#(= 0 ~x~0)} [133] L750-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {784#(= 0 ~x~0)} is VALID [2020-07-28 21:32:34,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {784#(= 0 ~x~0)} [145] P1ENTRY-->L725: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~__unbuffered_p1_EAX~0_4 v_~x~0_5)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base] {785#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {785#(= 0 ~__unbuffered_p1_EAX~0)} [165] L750-1-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_15 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_36))) (or (and (= 0 v_~main$tmp_guard0~0_15) (not .cse0)) (and (= 1 v_~main$tmp_guard0~0_15) .cse0)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {785#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,643 INFO L280 TraceCheckUtils]: 6: Hoare triple {785#(= 0 ~__unbuffered_p1_EAX~0)} [138] P0ENTRY-->L710: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~y~0_5) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_5, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {785#(= 0 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:32:34,645 INFO L280 TraceCheckUtils]: 7: Hoare triple {785#(= 0 ~__unbuffered_p1_EAX~0)} [177] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_28) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|) (= 1 v_~__unbuffered_p1_EAX~0_38) (= 2 v_~y~0_41) (= 0 v_~main$tmp_guard1~0_30) (= v_ULTIMATE.start_assume_abort_if_not_~cond_22 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_22))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y~0=v_~y~0_41} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_28, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y~0=v_~y~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {783#false} is VALID [2020-07-28 21:32:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:32:34,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524996119] [2020-07-28 21:32:34,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:32:34,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 21:32:34,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509609791] [2020-07-28 21:32:34,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-28 21:32:34,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:32:34,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:32:34,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:34,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:32:34,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:32:34,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:32:34,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:32:34,662 INFO L87 Difference]: Start difference. First operand 53 states and 106 transitions. Second operand 4 states. [2020-07-28 21:32:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,726 INFO L93 Difference]: Finished difference Result 60 states and 113 transitions. [2020-07-28 21:32:34,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 21:32:34,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-28 21:32:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:32:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:32:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-28 21:32:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:32:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-28 21:32:34,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2020-07-28 21:32:34,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:34,763 INFO L225 Difference]: With dead ends: 60 [2020-07-28 21:32:34,764 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 21:32:34,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:32:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 21:32:34,767 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,767 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,768 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,768 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,768 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,768 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,769 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,769 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,769 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,769 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,769 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,770 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,770 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,770 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,770 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,771 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,771 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,771 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,771 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,772 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,772 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,772 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,772 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,772 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,773 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,773 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,773 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,773 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,774 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,774 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,774 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,774 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,775 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,775 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,775 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,775 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-28 21:32:34,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:32:34,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-28 21:32:34,776 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-28 21:32:34,777 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-28 21:32:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,779 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. [2020-07-28 21:32:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 63 transitions. [2020-07-28 21:32:34,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:34,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:34,780 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-28 21:32:34,780 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-28 21:32:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:34,782 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. [2020-07-28 21:32:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 63 transitions. [2020-07-28 21:32:34,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:34,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:34,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:32:34,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:32:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-28 21:32:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2020-07-28 21:32:34,786 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 63 transitions. Word has length 8 [2020-07-28 21:32:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:32:34,786 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 63 transitions. [2020-07-28 21:32:34,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:32:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 63 transitions. [2020-07-28 21:32:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 21:32:34,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:32:34,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:32:34,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 21:32:34,787 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:32:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:32:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1840071362, now seen corresponding path program 1 times [2020-07-28 21:32:34,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:32:34,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95871709] [2020-07-28 21:32:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:32:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:32:34,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {994#true} [178] ULTIMATE.startENTRY-->L748: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2021~0.offset_14|) (= 0 v_~y~0_42) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x~0_25) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2021~0.base_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18|) |v_ULTIMATE.start_main_~#t2021~0.offset_14| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_58) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18|)) (= 0 |v_#NULL.offset_4|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~main$tmp_guard0~0_23) (= 0 v_~main$tmp_guard1~0_31) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2021~0.base_18| 4)) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_14|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_18|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2021~0.base=|v_ULTIMATE.start_main_~#t2021~0.base_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2021~0.offset=|v_ULTIMATE.start_main_~#t2021~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y~0=v_~y~0_42, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2021~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2021~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2022~0.base] {996#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:34,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {996#(= 0 ~__unbuffered_cnt~0)} [131] L748-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {996#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:34,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {996#(= 0 ~__unbuffered_cnt~0)} [166] L748-1-->L750: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2022~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12|) |v_ULTIMATE.start_main_~#t2022~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2022~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2022~0.base_12|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2022~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_11|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2022~0.base] {996#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:34,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {996#(= 0 ~__unbuffered_cnt~0)} [133] L750-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {996#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:34,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {996#(= 0 ~__unbuffered_cnt~0)} [165] L750-1-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_15 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_36))) (or (and (= 0 v_~main$tmp_guard0~0_15) (not .cse0)) (and (= 1 v_~main$tmp_guard0~0_15) .cse0)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {997#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)} is VALID [2020-07-28 21:32:34,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {997#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)} [138] P0ENTRY-->L710: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~y~0_5) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_5, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {997#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)} is VALID [2020-07-28 21:32:34,932 INFO L280 TraceCheckUtils]: 6: Hoare triple {997#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)} [120] L710-->L713: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {997#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)} is VALID [2020-07-28 21:32:34,932 INFO L280 TraceCheckUtils]: 7: Hoare triple {997#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)} [145] P1ENTRY-->L725: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~__unbuffered_p1_EAX~0_4 v_~x~0_5)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base] {997#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)} is VALID [2020-07-28 21:32:34,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {997#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)} [177] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_28) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|) (= 1 v_~__unbuffered_p1_EAX~0_38) (= 2 v_~y~0_41) (= 0 v_~main$tmp_guard1~0_30) (= v_ULTIMATE.start_assume_abort_if_not_~cond_22 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_22))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y~0=v_~y~0_41} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_28, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y~0=v_~y~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {995#false} is VALID [2020-07-28 21:32:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:32:34,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95871709] [2020-07-28 21:32:34,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:32:34,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 21:32:34,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802814816] [2020-07-28 21:32:34,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 21:32:34,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:32:34,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:32:34,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:34,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:32:34,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:32:34,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:32:34,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:32:34,950 INFO L87 Difference]: Start difference. First operand 36 states and 63 transitions. Second operand 4 states. [2020-07-28 21:32:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,037 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2020-07-28 21:32:35,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 21:32:35,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 21:32:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:32:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:32:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-28 21:32:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:32:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-28 21:32:35,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2020-07-28 21:32:35,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:35,091 INFO L225 Difference]: With dead ends: 39 [2020-07-28 21:32:35,091 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 21:32:35,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:32:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 21:32:35,096 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,096 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,098 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,099 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,099 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,099 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,100 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,100 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,100 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,101 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,101 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,101 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,102 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,102 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,102 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,102 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,103 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,103 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,103 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,105 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,106 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,106 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,108 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,109 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,109 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,109 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,109 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,110 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,110 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-28 21:32:35,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:32:35,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-28 21:32:35,111 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 21:32:35,111 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 21:32:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,112 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. [2020-07-28 21:32:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2020-07-28 21:32:35,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:35,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:35,113 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 21:32:35,114 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 21:32:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,115 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. [2020-07-28 21:32:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2020-07-28 21:32:35,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:35,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:35,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:32:35,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:32:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-28 21:32:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2020-07-28 21:32:35,118 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 9 [2020-07-28 21:32:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:32:35,118 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. [2020-07-28 21:32:35,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:32:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2020-07-28 21:32:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 21:32:35,119 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:32:35,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:32:35,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 21:32:35,119 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:32:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:32:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 419248155, now seen corresponding path program 1 times [2020-07-28 21:32:35,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:32:35,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907179558] [2020-07-28 21:32:35,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:32:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:32:35,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {1157#true} [178] ULTIMATE.startENTRY-->L748: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2021~0.offset_14|) (= 0 v_~y~0_42) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x~0_25) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2021~0.base_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18|) |v_ULTIMATE.start_main_~#t2021~0.offset_14| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_58) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18|)) (= 0 |v_#NULL.offset_4|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~main$tmp_guard0~0_23) (= 0 v_~main$tmp_guard1~0_31) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2021~0.base_18| 4)) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_14|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_18|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2021~0.base=|v_ULTIMATE.start_main_~#t2021~0.base_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2021~0.offset=|v_ULTIMATE.start_main_~#t2021~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y~0=v_~y~0_42, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2021~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2021~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2022~0.base] {1159#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:35,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1159#(= 0 ~__unbuffered_cnt~0)} [131] L748-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {1159#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:35,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {1159#(= 0 ~__unbuffered_cnt~0)} [166] L748-1-->L750: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2022~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12|) |v_ULTIMATE.start_main_~#t2022~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2022~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2022~0.base_12|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2022~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_11|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2022~0.base] {1159#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:35,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {1159#(= 0 ~__unbuffered_cnt~0)} [133] L750-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {1159#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:35,219 INFO L280 TraceCheckUtils]: 4: Hoare triple {1159#(= 0 ~__unbuffered_cnt~0)} [138] P0ENTRY-->L710: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~y~0_5) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_5, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {1159#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:35,219 INFO L280 TraceCheckUtils]: 5: Hoare triple {1159#(= 0 ~__unbuffered_cnt~0)} [120] L710-->L713: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {1159#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:32:35,220 INFO L280 TraceCheckUtils]: 6: Hoare triple {1159#(= 0 ~__unbuffered_cnt~0)} [161] L713-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_31 1) v_~__unbuffered_cnt~0_30) (= 0 |v_P0Thread1of1ForFork0_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {1160#(<= ~__unbuffered_cnt~0 1)} is VALID [2020-07-28 21:32:35,221 INFO L280 TraceCheckUtils]: 7: Hoare triple {1160#(<= ~__unbuffered_cnt~0 1)} [145] P1ENTRY-->L725: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~__unbuffered_p1_EAX~0_4 v_~x~0_5)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base] {1160#(<= ~__unbuffered_cnt~0 1)} is VALID [2020-07-28 21:32:35,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {1160#(<= ~__unbuffered_cnt~0 1)} [165] L750-1-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_15 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_36))) (or (and (= 0 v_~main$tmp_guard0~0_15) (not .cse0)) (and (= 1 v_~main$tmp_guard0~0_15) .cse0)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {1161#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond| 1)))} is VALID [2020-07-28 21:32:35,224 INFO L280 TraceCheckUtils]: 9: Hoare triple {1161#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond| 1)))} [177] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_28) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|) (= 1 v_~__unbuffered_p1_EAX~0_38) (= 2 v_~y~0_41) (= 0 v_~main$tmp_guard1~0_30) (= v_ULTIMATE.start_assume_abort_if_not_~cond_22 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_22))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y~0=v_~y~0_41} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_28, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y~0=v_~y~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {1158#false} is VALID [2020-07-28 21:32:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:32:35,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907179558] [2020-07-28 21:32:35,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:32:35,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:32:35,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256866321] [2020-07-28 21:32:35,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 21:32:35,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:32:35,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 21:32:35,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:35,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 21:32:35,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:32:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 21:32:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:32:35,242 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 5 states. [2020-07-28 21:32:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,351 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2020-07-28 21:32:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 21:32:35,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-28 21:32:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:32:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:32:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-07-28 21:32:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:32:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-07-28 21:32:35,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2020-07-28 21:32:35,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:35,392 INFO L225 Difference]: With dead ends: 27 [2020-07-28 21:32:35,393 INFO L226 Difference]: Without dead ends: 22 [2020-07-28 21:32:35,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 21:32:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-28 21:32:35,395 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,395 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,395 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,396 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,396 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,396 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,397 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,397 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,397 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,397 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,398 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,398 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,398 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,399 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,399 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,399 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,400 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,400 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,400 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,400 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,401 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,401 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:32:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-28 21:32:35,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:32:35,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-28 21:32:35,402 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 21:32:35,402 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 21:32:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,404 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-28 21:32:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:32:35,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:35,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:35,405 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 21:32:35,405 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 21:32:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,406 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-28 21:32:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:32:35,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:35,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:35,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:32:35,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:32:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 21:32:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-07-28 21:32:35,409 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 10 [2020-07-28 21:32:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:32:35,410 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-28 21:32:35,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 21:32:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:32:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 21:32:35,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:32:35,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:32:35,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 21:32:35,411 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:32:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:32:35,412 INFO L82 PathProgramCache]: Analyzing trace with hash -830614075, now seen corresponding path program 1 times [2020-07-28 21:32:35,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:32:35,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109121895] [2020-07-28 21:32:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:32:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:32:35,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {1281#true} [178] ULTIMATE.startENTRY-->L748: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2021~0.offset_14|) (= 0 v_~y~0_42) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x~0_25) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2021~0.base_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2021~0.base_18|) |v_ULTIMATE.start_main_~#t2021~0.offset_14| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_58) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2021~0.base_18|)) (= 0 |v_#NULL.offset_4|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~main$tmp_guard0~0_23) (= 0 v_~main$tmp_guard1~0_31) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2021~0.base_18| 4)) (= 0 |v_#NULL.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_14|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_18|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2021~0.base=|v_ULTIMATE.start_main_~#t2021~0.base_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2021~0.offset=|v_ULTIMATE.start_main_~#t2021~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y~0=v_~y~0_42, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2021~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2021~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2022~0.base] {1281#true} is VALID [2020-07-28 21:32:35,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {1281#true} [131] L748-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {1281#true} is VALID [2020-07-28 21:32:35,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {1281#true} [166] L748-1-->L750: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2022~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2022~0.base_12|) |v_ULTIMATE.start_main_~#t2022~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2022~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2022~0.base_12|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2022~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2022~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2022~0.offset=|v_ULTIMATE.start_main_~#t2022~0.offset_11|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2022~0.base=|v_ULTIMATE.start_main_~#t2022~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2022~0.offset, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2022~0.base] {1281#true} is VALID [2020-07-28 21:32:35,490 INFO L280 TraceCheckUtils]: 3: Hoare triple {1281#true} [133] L750-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {1281#true} is VALID [2020-07-28 21:32:35,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {1281#true} [138] P0ENTRY-->L710: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~y~0_5) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_5, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {1281#true} is VALID [2020-07-28 21:32:35,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {1281#true} [120] L710-->L713: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] {1281#true} is VALID [2020-07-28 21:32:35,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {1281#true} [161] L713-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_31 1) v_~__unbuffered_cnt~0_30) (= 0 |v_P0Thread1of1ForFork0_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {1281#true} is VALID [2020-07-28 21:32:35,492 INFO L280 TraceCheckUtils]: 7: Hoare triple {1281#true} [145] P1ENTRY-->L725: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~__unbuffered_p1_EAX~0_4 v_~x~0_5)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base] {1281#true} is VALID [2020-07-28 21:32:35,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {1281#true} [126] L725-->L728: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] {1283#(= 1 ~y~0)} is VALID [2020-07-28 21:32:35,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {1283#(= 1 ~y~0)} [168] L728-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_11|) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {1283#(= 1 ~y~0)} is VALID [2020-07-28 21:32:35,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {1283#(= 1 ~y~0)} [165] L750-1-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_15 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_36))) (or (and (= 0 v_~main$tmp_guard0~0_15) (not .cse0)) (and (= 1 v_~main$tmp_guard0~0_15) .cse0)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_6|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {1283#(= 1 ~y~0)} is VALID [2020-07-28 21:32:35,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {1283#(= 1 ~y~0)} [177] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_28) (= (mod v_~main$tmp_guard1~0_30 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|) (= 1 v_~__unbuffered_p1_EAX~0_38) (= 2 v_~y~0_41) (= 0 v_~main$tmp_guard1~0_30) (= v_ULTIMATE.start_assume_abort_if_not_~cond_22 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_22))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y~0=v_~y~0_41} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_20|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_28, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y~0=v_~y~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_20|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {1282#false} is VALID [2020-07-28 21:32:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:32:35,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109121895] [2020-07-28 21:32:35,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:32:35,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 21:32:35,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122344437] [2020-07-28 21:32:35,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-28 21:32:35,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:32:35,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 21:32:35,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:35,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 21:32:35,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:32:35,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 21:32:35,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:32:35,523 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 3 states. [2020-07-28 21:32:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,544 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-28 21:32:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 21:32:35,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-28 21:32:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:32:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:32:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-07-28 21:32:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:32:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-07-28 21:32:35,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2020-07-28 21:32:35,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:32:35,562 INFO L225 Difference]: With dead ends: 21 [2020-07-28 21:32:35,562 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 21:32:35,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:32:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 21:32:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 21:32:35,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:32:35,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 21:32:35,563 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:32:35,563 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:32:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,564 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:32:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:32:35,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:35,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:35,565 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:32:35,565 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:32:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:32:35,566 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:32:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:32:35,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:35,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:32:35,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:32:35,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:32:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 21:32:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 21:32:35,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-28 21:32:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:32:35,567 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 21:32:35,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 21:32:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:32:35,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:32:35,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 21:32:35,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 09:32:35 BasicIcfg [2020-07-28 21:32:35,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 21:32:35,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 21:32:35,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 21:32:35,574 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 21:32:35,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:32:31" (3/4) ... [2020-07-28 21:32:35,578 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 21:32:35,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2020-07-28 21:32:35,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2020-07-28 21:32:35,591 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-07-28 21:32:35,591 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 21:32:35,591 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 21:32:35,637 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 21:32:35,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 21:32:35,640 INFO L168 Benchmark]: Toolchain (without parser) took 5601.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 961.6 MB in the beginning and 968.2 MB in the end (delta: -6.6 MB). Peak memory consumption was 192.1 MB. Max. memory is 11.5 GB. [2020-07-28 21:32:35,641 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:32:35,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2020-07-28 21:32:35,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:32:35,643 INFO L168 Benchmark]: Boogie Preprocessor took 30.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:32:35,643 INFO L168 Benchmark]: RCFGBuilder took 440.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2020-07-28 21:32:35,644 INFO L168 Benchmark]: TraceAbstraction took 4276.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 968.2 MB in the end (delta: 89.8 MB). Peak memory consumption was 165.9 MB. Max. memory is 11.5 GB. [2020-07-28 21:32:35,645 INFO L168 Benchmark]: Witness Printer took 64.87 ms. Allocated memory is still 1.2 GB. Free memory is still 968.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:32:35,648 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 727.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 440.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4276.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 968.2 MB in the end (delta: 89.8 MB). Peak memory consumption was 165.9 MB. Max. memory is 11.5 GB. * Witness Printer took 64.87 ms. Allocated memory is still 1.2 GB. Free memory is still 968.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 60 ProgramPointsBefore, 22 ProgramPointsAfterwards, 55 TransitionsBefore, 15 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 7 FixpointIterations, 12 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 372 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 1251 CheckedPairsTotal, 49 TotalNumberOfCompositions - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 71 SDtfs, 42 SDslu, 61 SDs, 0 SdLazy, 47 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 1006 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...