./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi000_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/rfi000_pso.opt.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 fa041608809d444b2c1f56abe61099842d8954f6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:21:15,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:21:15,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:21:15,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:21:15,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:21:15,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:21:15,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:21:15,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:21:15,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:21:15,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:21:15,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:21:15,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:21:15,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:21:15,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:21:15,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:21:15,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:21:15,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:21:15,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:21:15,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:21:15,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:21:15,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:21:15,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:21:15,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:21:15,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:21:15,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:21:15,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:21:15,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:21:15,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:21:15,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:21:15,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:21:15,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:21:15,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:21:15,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:21:15,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:21:15,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:21:15,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:21:15,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:21:15,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:21:15,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:21:15,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:21:15,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:21:15,817 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:21:15,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:21:15,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:21:15,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:21:15,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:21:15,858 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:21:15,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:21:15,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:21:15,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:21:15,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:21:15,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:21:15,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:21:15,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:21:15,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:21:15,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:21:15,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:21:15,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:21:15,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:21:15,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:21:15,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:21:15,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:21:15,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:21:15,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:21:15,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:21:15,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:21:15,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:21:15,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:21:15,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:21:15,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:21:15,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:21:15,867 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 -> fa041608809d444b2c1f56abe61099842d8954f6 [2019-11-28 18:21:16,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:21:16,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:21:16,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:21:16,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:21:16,196 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:21:16,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi000_pso.opt.i [2019-11-28 18:21:16,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5425b715c/d6dc805e2d8a4c40910d060f8d2156ba/FLAGe8ce09067 [2019-11-28 18:21:16,847 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:21:16,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi000_pso.opt.i [2019-11-28 18:21:16,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5425b715c/d6dc805e2d8a4c40910d060f8d2156ba/FLAGe8ce09067 [2019-11-28 18:21:17,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5425b715c/d6dc805e2d8a4c40910d060f8d2156ba [2019-11-28 18:21:17,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:21:17,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:21:17,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:21:17,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:21:17,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:21:17,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8bbb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17, skipping insertion in model container [2019-11-28 18:21:17,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:21:17,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:21:17,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:21:17,705 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:21:17,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:21:17,844 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:21:17,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17 WrapperNode [2019-11-28 18:21:17,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:21:17,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:21:17,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:21:17,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:21:17,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:21:17,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:21:17,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:21:17,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:21:17,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:21:17,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:21:17,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:21:17,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:21:17,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (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 [2019-11-28 18:21:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:21:18,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:21:18,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:21:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:21:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:21:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:21:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:21:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:21:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:21:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:21:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:21:18,062 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:21:18,797 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:21:18,798 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:21:18,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:18 BoogieIcfgContainer [2019-11-28 18:21:18,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:21:18,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:21:18,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:21:18,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:21:18,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:21:17" (1/3) ... [2019-11-28 18:21:18,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32792bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:18, skipping insertion in model container [2019-11-28 18:21:18,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (2/3) ... [2019-11-28 18:21:18,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32792bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:18, skipping insertion in model container [2019-11-28 18:21:18,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:18" (3/3) ... [2019-11-28 18:21:18,811 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2019-11-28 18:21:18,821 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:21:18,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:21:18,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:21:18,834 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:21:18,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,888 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,888 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,899 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,929 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:21:18,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:21:18,946 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:21:18,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:21:18,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:21:18,947 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:21:18,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:21:18,947 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:21:18,948 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:21:18,968 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:21:18,971 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:21:19,057 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:21:19,058 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:21:19,077 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 465 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:21:19,096 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:21:19,142 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:21:19,143 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:21:19,149 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 465 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:21:19,163 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-11-28 18:21:19,165 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:21:21,727 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-11-28 18:21:23,754 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:21:23,877 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:21:23,901 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50487 [2019-11-28 18:21:23,901 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-11-28 18:21:23,905 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-11-28 18:21:24,525 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-11-28 18:21:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-11-28 18:21:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:21:24,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:24,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:21:24,539 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:24,548 INFO L82 PathProgramCache]: Analyzing trace with hash 692929394, now seen corresponding path program 1 times [2019-11-28 18:21:24,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:24,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166340855] [2019-11-28 18:21:24,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:24,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166340855] [2019-11-28 18:21:24,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:24,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:21:24,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185019923] [2019-11-28 18:21:24,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:24,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:24,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:24,869 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-11-28 18:21:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:25,115 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-11-28 18:21:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:25,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:21:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:25,218 INFO L225 Difference]: With dead ends: 9416 [2019-11-28 18:21:25,220 INFO L226 Difference]: Without dead ends: 9234 [2019-11-28 18:21:25,226 INFO L630 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 [2019-11-28 18:21:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-11-28 18:21:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-11-28 18:21:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-11-28 18:21:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-11-28 18:21:25,687 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-11-28 18:21:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:25,688 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-11-28 18:21:25,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-11-28 18:21:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:21:25,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:25,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:25,692 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:25,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1820083367, now seen corresponding path program 1 times [2019-11-28 18:21:25,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:25,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180694012] [2019-11-28 18:21:25,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:25,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180694012] [2019-11-28 18:21:25,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:25,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:25,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026569331] [2019-11-28 18:21:25,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:25,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:25,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:25,851 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-11-28 18:21:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:26,287 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-11-28 18:21:26,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:26,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:21:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:26,387 INFO L225 Difference]: With dead ends: 14362 [2019-11-28 18:21:26,387 INFO L226 Difference]: Without dead ends: 14355 [2019-11-28 18:21:26,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-11-28 18:21:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-11-28 18:21:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-11-28 18:21:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-11-28 18:21:27,080 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-11-28 18:21:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:27,080 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-11-28 18:21:27,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-11-28 18:21:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:21:27,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:27,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:27,084 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash 417951775, now seen corresponding path program 1 times [2019-11-28 18:21:27,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:27,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539767198] [2019-11-28 18:21:27,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:27,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539767198] [2019-11-28 18:21:27,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:27,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:27,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113363339] [2019-11-28 18:21:27,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:27,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:27,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:27,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:27,156 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-11-28 18:21:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:27,174 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-11-28 18:21:27,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:27,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:21:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:27,180 INFO L225 Difference]: With dead ends: 1778 [2019-11-28 18:21:27,181 INFO L226 Difference]: Without dead ends: 1778 [2019-11-28 18:21:27,181 INFO L630 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 [2019-11-28 18:21:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-11-28 18:21:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-11-28 18:21:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-11-28 18:21:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-11-28 18:21:27,227 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-11-28 18:21:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:27,227 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-11-28 18:21:27,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-11-28 18:21:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 18:21:27,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:27,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:27,234 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1954901459, now seen corresponding path program 1 times [2019-11-28 18:21:27,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:27,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483093219] [2019-11-28 18:21:27,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:27,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483093219] [2019-11-28 18:21:27,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:27,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:27,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127940530] [2019-11-28 18:21:27,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:27,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:27,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:27,362 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 4 states. [2019-11-28 18:21:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:27,377 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-11-28 18:21:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:21:27,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-28 18:21:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:27,379 INFO L225 Difference]: With dead ends: 371 [2019-11-28 18:21:27,379 INFO L226 Difference]: Without dead ends: 371 [2019-11-28 18:21:27,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-28 18:21:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-11-28 18:21:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-28 18:21:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-11-28 18:21:27,388 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-11-28 18:21:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:27,388 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-11-28 18:21:27,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-11-28 18:21:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:27,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:27,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:27,391 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:27,392 INFO L82 PathProgramCache]: Analyzing trace with hash 798988436, now seen corresponding path program 1 times [2019-11-28 18:21:27,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:27,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806864316] [2019-11-28 18:21:27,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:27,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806864316] [2019-11-28 18:21:27,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:27,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:27,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100567312] [2019-11-28 18:21:27,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:27,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:27,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:27,465 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-11-28 18:21:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:27,526 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-11-28 18:21:27,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:27,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:21:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:27,529 INFO L225 Difference]: With dead ends: 345 [2019-11-28 18:21:27,529 INFO L226 Difference]: Without dead ends: 345 [2019-11-28 18:21:27,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-28 18:21:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-11-28 18:21:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-28 18:21:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-11-28 18:21:27,539 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-11-28 18:21:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:27,540 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-11-28 18:21:27,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-11-28 18:21:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:27,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:27,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:27,545 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash 112676449, now seen corresponding path program 1 times [2019-11-28 18:21:27,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:27,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980545123] [2019-11-28 18:21:27,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:27,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980545123] [2019-11-28 18:21:27,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:27,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:27,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931386088] [2019-11-28 18:21:27,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:27,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:27,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:27,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:27,624 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-11-28 18:21:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:27,675 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-11-28 18:21:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:27,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:21:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:27,677 INFO L225 Difference]: With dead ends: 345 [2019-11-28 18:21:27,677 INFO L226 Difference]: Without dead ends: 345 [2019-11-28 18:21:27,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-28 18:21:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-11-28 18:21:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-28 18:21:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-11-28 18:21:27,686 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-11-28 18:21:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:27,688 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-11-28 18:21:27,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-11-28 18:21:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:27,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:27,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:27,690 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash 107384222, now seen corresponding path program 1 times [2019-11-28 18:21:27,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:27,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340883532] [2019-11-28 18:21:27,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:27,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340883532] [2019-11-28 18:21:27,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:27,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:21:27,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902914055] [2019-11-28 18:21:27,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:27,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:27,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:27,785 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 5 states. [2019-11-28 18:21:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:28,036 INFO L93 Difference]: Finished difference Result 475 states and 866 transitions. [2019-11-28 18:21:28,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:21:28,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-28 18:21:28,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:28,039 INFO L225 Difference]: With dead ends: 475 [2019-11-28 18:21:28,039 INFO L226 Difference]: Without dead ends: 475 [2019-11-28 18:21:28,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:21:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-28 18:21:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 360. [2019-11-28 18:21:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-28 18:21:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 661 transitions. [2019-11-28 18:21:28,048 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 661 transitions. Word has length 52 [2019-11-28 18:21:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:28,049 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 661 transitions. [2019-11-28 18:21:28,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 661 transitions. [2019-11-28 18:21:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:28,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:28,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:28,053 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2113386594, now seen corresponding path program 2 times [2019-11-28 18:21:28,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:28,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652532732] [2019-11-28 18:21:28,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:28,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652532732] [2019-11-28 18:21:28,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:28,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:21:28,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046243244] [2019-11-28 18:21:28,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:21:28,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:21:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:28,244 INFO L87 Difference]: Start difference. First operand 360 states and 661 transitions. Second operand 6 states. [2019-11-28 18:21:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:28,543 INFO L93 Difference]: Finished difference Result 462 states and 842 transitions. [2019-11-28 18:21:28,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:21:28,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 18:21:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:28,545 INFO L225 Difference]: With dead ends: 462 [2019-11-28 18:21:28,545 INFO L226 Difference]: Without dead ends: 462 [2019-11-28 18:21:28,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:21:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-11-28 18:21:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 395. [2019-11-28 18:21:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-11-28 18:21:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 726 transitions. [2019-11-28 18:21:28,555 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 726 transitions. Word has length 52 [2019-11-28 18:21:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:28,556 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 726 transitions. [2019-11-28 18:21:28,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:21:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 726 transitions. [2019-11-28 18:21:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:28,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:28,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:28,558 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash -517730850, now seen corresponding path program 3 times [2019-11-28 18:21:28,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:28,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480124607] [2019-11-28 18:21:28,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:28,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480124607] [2019-11-28 18:21:28,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:28,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:21:28,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098994881] [2019-11-28 18:21:28,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:21:28,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:21:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:28,692 INFO L87 Difference]: Start difference. First operand 395 states and 726 transitions. Second operand 6 states. [2019-11-28 18:21:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:28,979 INFO L93 Difference]: Finished difference Result 475 states and 833 transitions. [2019-11-28 18:21:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:21:28,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 18:21:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:28,981 INFO L225 Difference]: With dead ends: 475 [2019-11-28 18:21:28,981 INFO L226 Difference]: Without dead ends: 475 [2019-11-28 18:21:28,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:21:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-28 18:21:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 379. [2019-11-28 18:21:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-28 18:21:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 677 transitions. [2019-11-28 18:21:28,990 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 677 transitions. Word has length 52 [2019-11-28 18:21:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:28,990 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 677 transitions. [2019-11-28 18:21:28,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:21:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 677 transitions. [2019-11-28 18:21:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:28,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:28,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:28,992 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash 936446688, now seen corresponding path program 4 times [2019-11-28 18:21:28,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:28,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76258985] [2019-11-28 18:21:28,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:29,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76258985] [2019-11-28 18:21:29,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:29,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:21:29,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282680554] [2019-11-28 18:21:29,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:21:29,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:21:29,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:29,104 INFO L87 Difference]: Start difference. First operand 379 states and 677 transitions. Second operand 6 states. [2019-11-28 18:21:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:29,180 INFO L93 Difference]: Finished difference Result 701 states and 1248 transitions. [2019-11-28 18:21:29,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:21:29,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 18:21:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:29,182 INFO L225 Difference]: With dead ends: 701 [2019-11-28 18:21:29,182 INFO L226 Difference]: Without dead ends: 339 [2019-11-28 18:21:29,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:21:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-28 18:21:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 307. [2019-11-28 18:21:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-28 18:21:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-11-28 18:21:29,189 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 52 [2019-11-28 18:21:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:29,189 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-11-28 18:21:29,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:21:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-11-28 18:21:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:29,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:29,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:29,191 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1118600804, now seen corresponding path program 5 times [2019-11-28 18:21:29,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:29,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813420946] [2019-11-28 18:21:29,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:29,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813420946] [2019-11-28 18:21:29,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:29,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:21:29,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338356884] [2019-11-28 18:21:29,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:21:29,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:21:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:21:29,296 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 7 states. [2019-11-28 18:21:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:29,655 INFO L93 Difference]: Finished difference Result 452 states and 775 transitions. [2019-11-28 18:21:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:21:29,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:21:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:29,658 INFO L225 Difference]: With dead ends: 452 [2019-11-28 18:21:29,658 INFO L226 Difference]: Without dead ends: 452 [2019-11-28 18:21:29,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:21:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-28 18:21:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 307. [2019-11-28 18:21:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-28 18:21:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-11-28 18:21:29,665 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 52 [2019-11-28 18:21:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:29,666 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-11-28 18:21:29,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:21:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-11-28 18:21:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:21:29,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:29,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:29,667 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:29,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1118119919, now seen corresponding path program 1 times [2019-11-28 18:21:29,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:29,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667302391] [2019-11-28 18:21:29,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:29,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667302391] [2019-11-28 18:21:29,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:29,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:29,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185177587] [2019-11-28 18:21:29,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:29,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:29,726 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 3 states. [2019-11-28 18:21:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:29,738 INFO L93 Difference]: Finished difference Result 268 states and 457 transitions. [2019-11-28 18:21:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:29,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 18:21:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:29,739 INFO L225 Difference]: With dead ends: 268 [2019-11-28 18:21:29,739 INFO L226 Difference]: Without dead ends: 268 [2019-11-28 18:21:29,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-28 18:21:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-11-28 18:21:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-28 18:21:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 457 transitions. [2019-11-28 18:21:29,745 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 457 transitions. Word has length 53 [2019-11-28 18:21:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:29,746 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 457 transitions. [2019-11-28 18:21:29,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 457 transitions. [2019-11-28 18:21:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:21:29,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:29,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:29,747 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash -167824730, now seen corresponding path program 1 times [2019-11-28 18:21:29,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:29,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925567638] [2019-11-28 18:21:29,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:30,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925567638] [2019-11-28 18:21:30,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:30,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:21:30,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069505370] [2019-11-28 18:21:30,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:21:30,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:30,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:21:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:21:30,119 INFO L87 Difference]: Start difference. First operand 268 states and 457 transitions. Second operand 11 states. [2019-11-28 18:21:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:30,731 INFO L93 Difference]: Finished difference Result 375 states and 618 transitions. [2019-11-28 18:21:30,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:21:30,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-11-28 18:21:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:30,737 INFO L225 Difference]: With dead ends: 375 [2019-11-28 18:21:30,737 INFO L226 Difference]: Without dead ends: 375 [2019-11-28 18:21:30,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-28 18:21:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-11-28 18:21:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 233. [2019-11-28 18:21:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-28 18:21:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 385 transitions. [2019-11-28 18:21:30,744 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 385 transitions. Word has length 53 [2019-11-28 18:21:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:30,746 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 385 transitions. [2019-11-28 18:21:30,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:21:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 385 transitions. [2019-11-28 18:21:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:21:30,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:30,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:30,748 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash 175082296, now seen corresponding path program 2 times [2019-11-28 18:21:30,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:30,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674670723] [2019-11-28 18:21:30,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:30,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674670723] [2019-11-28 18:21:30,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:30,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:30,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362671664] [2019-11-28 18:21:30,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:30,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:30,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:30,859 INFO L87 Difference]: Start difference. First operand 233 states and 385 transitions. Second operand 3 states. [2019-11-28 18:21:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:30,899 INFO L93 Difference]: Finished difference Result 232 states and 383 transitions. [2019-11-28 18:21:30,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:30,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 18:21:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:30,901 INFO L225 Difference]: With dead ends: 232 [2019-11-28 18:21:30,901 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 18:21:30,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 18:21:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 183. [2019-11-28 18:21:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-28 18:21:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 299 transitions. [2019-11-28 18:21:30,907 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 299 transitions. Word has length 53 [2019-11-28 18:21:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:30,908 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 299 transitions. [2019-11-28 18:21:30,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 299 transitions. [2019-11-28 18:21:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:21:30,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:30,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:30,913 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:30,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1455781027, now seen corresponding path program 1 times [2019-11-28 18:21:30,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:30,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682781224] [2019-11-28 18:21:30,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:21:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:21:31,130 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:21:31,131 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:21:31,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= 0 v_~x$read_delayed_var~0.offset_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1591~0.base_19|) (= |v_#NULL.offset_7| 0) (= v_~x$r_buff1_thd2~0_98 0) (= |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19| 1)) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19|) |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0)) |v_#memory_int_17|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| 4) |v_#length_17|) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19|)) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_~#t1591~0.base=|v_ULTIMATE.start_main_~#t1591~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y~0=v_~y~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_~#t1591~0.offset=|v_ULTIMATE.start_main_~#t1591~0.offset_14|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1592~0.base, #length, ULTIMATE.start_main_~#t1592~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1591~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1591~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:21:31,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1592~0.base_10| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1592~0.offset_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10|) |v_ULTIMATE.start_main_~#t1592~0.offset_9| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1592~0.offset, #length] because there is no mapped edge [2019-11-28 18:21:31,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= ~y~0_Out-483919183 1) (= ~x$r_buff1_thd0~0_Out-483919183 ~x$r_buff0_thd0~0_In-483919183) (= ~__unbuffered_p1_EAX~0_Out-483919183 ~y~0_Out-483919183) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-483919183 0)) (= ~x$r_buff0_thd1~0_In-483919183 ~x$r_buff1_thd1~0_Out-483919183) (= ~x$r_buff0_thd2~0_In-483919183 ~x$r_buff1_thd2~0_Out-483919183) (= ~x$r_buff0_thd2~0_Out-483919183 1) (= ~y~0_Out-483919183 ~__unbuffered_p1_EBX~0_Out-483919183)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-483919183, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-483919183, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-483919183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-483919183} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-483919183, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-483919183, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-483919183, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-483919183, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-483919183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-483919183, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-483919183, ~y~0=~y~0_Out-483919183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-483919183, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-483919183} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:21:31,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-1279020264 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1279020264 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-1279020264| ~x$w_buff1~0_In-1279020264) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-1279020264| ~x~0_In-1279020264)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1279020264, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279020264, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1279020264, ~x~0=~x~0_In-1279020264} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1279020264|, ~x$w_buff1~0=~x$w_buff1~0_In-1279020264, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279020264, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1279020264, ~x~0=~x~0_In-1279020264} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-11-28 18:21:31,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_14|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_14|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_13|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_5|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-11-28 18:21:31,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In956490293 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In956490293 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out956490293| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out956490293| ~x$w_buff0_used~0_In956490293) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In956490293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956490293} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out956490293|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In956490293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956490293} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:21:31,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-1265593214 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1265593214 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1265593214 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1265593214 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1265593214|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1265593214 |P0Thread1of1ForFork0_#t~ite6_Out-1265593214|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1265593214, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1265593214, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1265593214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1265593214} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1265593214|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1265593214, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1265593214, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1265593214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1265593214} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:21:31,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1717813181 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1717813181 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1717813181|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-1717813181 |P0Thread1of1ForFork0_#t~ite7_Out-1717813181|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1717813181, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1717813181} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1717813181, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1717813181|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1717813181} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:21:31,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-46025333 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-46025333 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-46025333|)) (and (= ~x$w_buff0_used~0_In-46025333 |P1Thread1of1ForFork1_#t~ite11_Out-46025333|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-46025333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-46025333} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-46025333|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-46025333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-46025333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:21:31,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In836294676 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In836294676 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In836294676 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In836294676 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out836294676|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In836294676 |P1Thread1of1ForFork1_#t~ite12_Out836294676|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In836294676, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In836294676, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In836294676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In836294676} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In836294676, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In836294676, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out836294676|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In836294676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In836294676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:21:31,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out-2139310576 ~x$r_buff0_thd2~0_In-2139310576)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2139310576 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2139310576 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (= ~x$r_buff0_thd2~0_Out-2139310576 0) (not .cse1) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2139310576, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139310576} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2139310576|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2139310576, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139310576} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:21:31,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In895278385 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In895278385 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In895278385 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In895278385 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out895278385| ~x$r_buff1_thd2~0_In895278385) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out895278385|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In895278385, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In895278385, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In895278385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In895278385} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In895278385, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In895278385, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In895278385, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out895278385|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In895278385} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:21:31,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:21:31,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-672183714 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-672183714 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-672183714 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-672183714 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-672183714| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-672183714| ~x$r_buff1_thd1~0_In-672183714) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-672183714, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-672183714, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-672183714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-672183714} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-672183714, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-672183714|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-672183714, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-672183714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-672183714} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:21:31,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:21:31,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:21:31,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In883153148 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In883153148 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out883153148| ~x~0_In883153148)) (and (= ~x$w_buff1~0_In883153148 |ULTIMATE.start_main_#t~ite17_Out883153148|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In883153148, ~x$w_buff1_used~0=~x$w_buff1_used~0_In883153148, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In883153148, ~x~0=~x~0_In883153148} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out883153148|, ~x$w_buff1~0=~x$w_buff1~0_In883153148, ~x$w_buff1_used~0=~x$w_buff1_used~0_In883153148, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In883153148, ~x~0=~x~0_In883153148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:21:31,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-11-28 18:21:31,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1960228126 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1960228126 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1960228126 |ULTIMATE.start_main_#t~ite19_Out-1960228126|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1960228126|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1960228126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960228126} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1960228126, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1960228126|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960228126} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:21:31,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1582662029 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1582662029 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1582662029 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1582662029 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out1582662029|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1582662029 |ULTIMATE.start_main_#t~ite20_Out1582662029|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1582662029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1582662029, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1582662029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1582662029} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1582662029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1582662029, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1582662029|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1582662029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1582662029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:21:31,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1713256631 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1713256631 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out1713256631|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1713256631 |ULTIMATE.start_main_#t~ite21_Out1713256631|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1713256631, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1713256631} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1713256631, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1713256631|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1713256631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:21:31,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-915286703 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-915286703 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-915286703 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-915286703 256)))) (or (and (= ~x$r_buff1_thd0~0_In-915286703 |ULTIMATE.start_main_#t~ite22_Out-915286703|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-915286703|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-915286703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-915286703, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-915286703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-915286703} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-915286703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-915286703, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-915286703, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-915286703|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-915286703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:21:31,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:21:31,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:21:31,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:21:31,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:21:31 BasicIcfg [2019-11-28 18:21:31,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:21:31,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:21:31,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:21:31,287 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:21:31,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:18" (3/4) ... [2019-11-28 18:21:31,291 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:21:31,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= 0 v_~x$read_delayed_var~0.offset_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1591~0.base_19|) (= |v_#NULL.offset_7| 0) (= v_~x$r_buff1_thd2~0_98 0) (= |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19| 1)) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19|) |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0)) |v_#memory_int_17|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| 4) |v_#length_17|) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19|)) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_~#t1591~0.base=|v_ULTIMATE.start_main_~#t1591~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y~0=v_~y~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_~#t1591~0.offset=|v_ULTIMATE.start_main_~#t1591~0.offset_14|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1592~0.base, #length, ULTIMATE.start_main_~#t1592~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1591~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1591~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:21:31,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1592~0.base_10| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1592~0.offset_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10|) |v_ULTIMATE.start_main_~#t1592~0.offset_9| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1592~0.offset, #length] because there is no mapped edge [2019-11-28 18:21:31,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= ~y~0_Out-483919183 1) (= ~x$r_buff1_thd0~0_Out-483919183 ~x$r_buff0_thd0~0_In-483919183) (= ~__unbuffered_p1_EAX~0_Out-483919183 ~y~0_Out-483919183) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-483919183 0)) (= ~x$r_buff0_thd1~0_In-483919183 ~x$r_buff1_thd1~0_Out-483919183) (= ~x$r_buff0_thd2~0_In-483919183 ~x$r_buff1_thd2~0_Out-483919183) (= ~x$r_buff0_thd2~0_Out-483919183 1) (= ~y~0_Out-483919183 ~__unbuffered_p1_EBX~0_Out-483919183)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-483919183, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-483919183, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-483919183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-483919183} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-483919183, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-483919183, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-483919183, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-483919183, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-483919183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-483919183, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-483919183, ~y~0=~y~0_Out-483919183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-483919183, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-483919183} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:21:31,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-1279020264 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1279020264 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-1279020264| ~x$w_buff1~0_In-1279020264) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-1279020264| ~x~0_In-1279020264)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1279020264, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279020264, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1279020264, ~x~0=~x~0_In-1279020264} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1279020264|, ~x$w_buff1~0=~x$w_buff1~0_In-1279020264, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279020264, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1279020264, ~x~0=~x~0_In-1279020264} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-11-28 18:21:31,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_14|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_14|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_13|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_5|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-11-28 18:21:31,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In956490293 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In956490293 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out956490293| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out956490293| ~x$w_buff0_used~0_In956490293) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In956490293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956490293} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out956490293|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In956490293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In956490293} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:21:31,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-1265593214 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1265593214 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1265593214 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1265593214 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1265593214|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1265593214 |P0Thread1of1ForFork0_#t~ite6_Out-1265593214|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1265593214, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1265593214, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1265593214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1265593214} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1265593214|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1265593214, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1265593214, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1265593214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1265593214} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:21:31,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1717813181 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1717813181 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1717813181|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-1717813181 |P0Thread1of1ForFork0_#t~ite7_Out-1717813181|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1717813181, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1717813181} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1717813181, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1717813181|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1717813181} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:21:31,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-46025333 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-46025333 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-46025333|)) (and (= ~x$w_buff0_used~0_In-46025333 |P1Thread1of1ForFork1_#t~ite11_Out-46025333|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-46025333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-46025333} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-46025333|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-46025333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-46025333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:21:31,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In836294676 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In836294676 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In836294676 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In836294676 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out836294676|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In836294676 |P1Thread1of1ForFork1_#t~ite12_Out836294676|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In836294676, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In836294676, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In836294676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In836294676} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In836294676, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In836294676, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out836294676|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In836294676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In836294676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:21:31,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out-2139310576 ~x$r_buff0_thd2~0_In-2139310576)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2139310576 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2139310576 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (= ~x$r_buff0_thd2~0_Out-2139310576 0) (not .cse1) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2139310576, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139310576} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2139310576|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2139310576, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139310576} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:21:31,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In895278385 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In895278385 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In895278385 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In895278385 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out895278385| ~x$r_buff1_thd2~0_In895278385) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out895278385|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In895278385, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In895278385, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In895278385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In895278385} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In895278385, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In895278385, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In895278385, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out895278385|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In895278385} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:21:31,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:21:31,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-672183714 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-672183714 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-672183714 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-672183714 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-672183714| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-672183714| ~x$r_buff1_thd1~0_In-672183714) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-672183714, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-672183714, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-672183714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-672183714} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-672183714, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-672183714|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-672183714, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-672183714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-672183714} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:21:31,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:21:31,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:21:31,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In883153148 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In883153148 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out883153148| ~x~0_In883153148)) (and (= ~x$w_buff1~0_In883153148 |ULTIMATE.start_main_#t~ite17_Out883153148|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In883153148, ~x$w_buff1_used~0=~x$w_buff1_used~0_In883153148, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In883153148, ~x~0=~x~0_In883153148} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out883153148|, ~x$w_buff1~0=~x$w_buff1~0_In883153148, ~x$w_buff1_used~0=~x$w_buff1_used~0_In883153148, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In883153148, ~x~0=~x~0_In883153148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:21:31,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-11-28 18:21:31,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1960228126 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1960228126 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1960228126 |ULTIMATE.start_main_#t~ite19_Out-1960228126|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1960228126|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1960228126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960228126} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1960228126, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1960228126|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1960228126} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:21:31,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1582662029 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1582662029 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1582662029 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1582662029 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out1582662029|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1582662029 |ULTIMATE.start_main_#t~ite20_Out1582662029|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1582662029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1582662029, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1582662029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1582662029} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1582662029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1582662029, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1582662029|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1582662029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1582662029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:21:31,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1713256631 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1713256631 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out1713256631|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1713256631 |ULTIMATE.start_main_#t~ite21_Out1713256631|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1713256631, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1713256631} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1713256631, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1713256631|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1713256631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:21:31,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-915286703 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-915286703 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-915286703 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-915286703 256)))) (or (and (= ~x$r_buff1_thd0~0_In-915286703 |ULTIMATE.start_main_#t~ite22_Out-915286703|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-915286703|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-915286703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-915286703, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-915286703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-915286703} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-915286703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-915286703, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-915286703, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-915286703|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-915286703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:21:31,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:21:31,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:21:31,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:21:31,431 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:21:31,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:21:31,433 INFO L168 Benchmark]: Toolchain (without parser) took 14309.02 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 527.4 MB). Free memory was 955.0 MB in the beginning and 1.3 GB in the end (delta: -348.5 MB). Peak memory consumption was 178.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:31,434 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:21:31,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -145.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:31,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.09 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:31,443 INFO L168 Benchmark]: Boogie Preprocessor took 45.96 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. [2019-11-28 18:21:31,443 INFO L168 Benchmark]: RCFGBuilder took 822.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:31,443 INFO L168 Benchmark]: TraceAbstraction took 12485.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 395.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -268.0 MB). Peak memory consumption was 127.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:31,444 INFO L168 Benchmark]: Witness Printer took 145.02 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:31,446 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 719.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -145.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.09 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.96 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 822.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12485.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 395.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -268.0 MB). Peak memory consumption was 127.4 MB. Max. memory is 11.5 GB. * Witness Printer took 145.02 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3783 VarBasedMoverChecksPositive, 170 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 202 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50487 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1444 SDtfs, 897 SDslu, 2453 SDs, 0 SdLazy, 1693 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 26 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 2006 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 75319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...