./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.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/mix054_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4033a21503ef5f16f718d5502cb57c5c6653980b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:19:34,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:19:34,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:19:34,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:19:34,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:19:34,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:19:34,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:19:34,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:19:34,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:19:34,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:19:34,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:19:34,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:19:34,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:19:34,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:19:34,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:19:34,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:19:34,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:19:34,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:19:34,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:19:34,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:19:34,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:19:34,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:19:34,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:19:34,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:19:34,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:19:34,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:19:34,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:19:34,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:19:34,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:19:34,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:19:34,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:19:34,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:19:34,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:19:34,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:19:34,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:19:34,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:19:34,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:19:34,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:19:34,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:19:34,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:19:34,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:19:34,802 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:19:34,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:19:34,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:19:34,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:19:34,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:19:34,820 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:19:34,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:19:34,821 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:19:34,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:19:34,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:19:34,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:19:34,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:19:34,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:19:34,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:19:34,823 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:19:34,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:19:34,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:19:34,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:19:34,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:19:34,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:19:34,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:19:34,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:19:34,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:19:34,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:19:34,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:19:34,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:19:34,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:19:34,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:19:34,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:19:34,827 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:19:34,828 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 -> 4033a21503ef5f16f718d5502cb57c5c6653980b [2019-11-28 18:19:35,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:19:35,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:19:35,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:19:35,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:19:35,257 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:19:35,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i [2019-11-28 18:19:35,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e018dde7/f8ee28afe3024cc3be605a26499ec394/FLAG38c32c1cb [2019-11-28 18:19:35,912 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:19:35,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i [2019-11-28 18:19:35,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e018dde7/f8ee28afe3024cc3be605a26499ec394/FLAG38c32c1cb [2019-11-28 18:19:36,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e018dde7/f8ee28afe3024cc3be605a26499ec394 [2019-11-28 18:19:36,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:19:36,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:19:36,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:19:36,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:19:36,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:19:36,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:36,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c20c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36, skipping insertion in model container [2019-11-28 18:19:36,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:36,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:19:36,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:19:36,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:19:36,739 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:19:36,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:19:36,914 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:19:36,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36 WrapperNode [2019-11-28 18:19:36,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:19:36,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:19:36,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:19:36,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:19:36,927 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:19:36" (1/1) ... [2019-11-28 18:19:36,951 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:19:36" (1/1) ... [2019-11-28 18:19:36,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:19:36,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:19:36,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:19:36,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:19:36,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:36,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:37,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:37,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:37,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:37,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:37,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (1/1) ... [2019-11-28 18:19:37,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:19:37,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:19:37,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:19:37,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:19:37,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (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:19:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:19:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:19:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:19:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:19:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:19:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:19:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:19:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:19:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:19:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:19:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:19:37,099 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:19:37,822 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:19:37,823 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:19:37,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:37 BoogieIcfgContainer [2019-11-28 18:19:37,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:19:37,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:19:37,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:19:37,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:19:37,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:19:36" (1/3) ... [2019-11-28 18:19:37,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427f0f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:19:37, skipping insertion in model container [2019-11-28 18:19:37,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:36" (2/3) ... [2019-11-28 18:19:37,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427f0f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:19:37, skipping insertion in model container [2019-11-28 18:19:37,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:37" (3/3) ... [2019-11-28 18:19:37,834 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.oepc.i [2019-11-28 18:19:37,844 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:19:37,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:19:37,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:19:37,855 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:19:37,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,912 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:37,980 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:19:37,998 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:19:37,999 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:19:37,999 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:19:37,999 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:19:37,999 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:19:37,999 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:19:38,000 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:19:38,000 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:19:38,018 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-11-28 18:19:38,020 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-11-28 18:19:38,121 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-11-28 18:19:38,122 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:19:38,145 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:19:38,169 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-11-28 18:19:38,217 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-11-28 18:19:38,217 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:19:38,224 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:19:38,243 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:19:38,244 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:19:40,827 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-28 18:19:43,344 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-11-28 18:19:43,455 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 18:19:43,855 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-11-28 18:19:43,855 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-11-28 18:19:43,860 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-11-28 18:19:44,545 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-11-28 18:19:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-11-28 18:19:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:19:44,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:44,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:19:44,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:44,565 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-11-28 18:19:44,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:44,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342959101] [2019-11-28 18:19:44,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:44,826 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:19:44,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342959101] [2019-11-28 18:19:44,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:44,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:19:44,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689450196] [2019-11-28 18:19:44,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:44,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:44,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:44,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:44,852 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-11-28 18:19:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:45,122 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-11-28 18:19:45,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:45,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:19:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:45,255 INFO L225 Difference]: With dead ends: 8460 [2019-11-28 18:19:45,261 INFO L226 Difference]: Without dead ends: 7472 [2019-11-28 18:19:45,265 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:19:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-11-28 18:19:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-11-28 18:19:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-11-28 18:19:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-11-28 18:19:45,711 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-11-28 18:19:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:45,712 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-11-28 18:19:45,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-11-28 18:19:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:19:45,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:45,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:45,721 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-11-28 18:19:45,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:45,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110125962] [2019-11-28 18:19:45,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:45,859 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:19:45,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110125962] [2019-11-28 18:19:45,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:45,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:45,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923691556] [2019-11-28 18:19:45,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:45,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:45,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:45,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:45,868 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-11-28 18:19:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:46,439 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-11-28 18:19:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:46,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:19:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:46,535 INFO L225 Difference]: With dead ends: 11704 [2019-11-28 18:19:46,536 INFO L226 Difference]: Without dead ends: 11690 [2019-11-28 18:19:46,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 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:19:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-11-28 18:19:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-11-28 18:19:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-11-28 18:19:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-11-28 18:19:46,984 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-11-28 18:19:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:46,985 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-11-28 18:19:46,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-11-28 18:19:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:19:46,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:46,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:46,998 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-11-28 18:19:46,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:46,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397743491] [2019-11-28 18:19:46,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:47,145 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:19:47,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397743491] [2019-11-28 18:19:47,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:47,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:47,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482706998] [2019-11-28 18:19:47,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:47,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:47,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:47,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:47,149 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-11-28 18:19:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:47,593 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-11-28 18:19:47,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:19:47,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:19:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:47,651 INFO L225 Difference]: With dead ends: 15000 [2019-11-28 18:19:47,651 INFO L226 Difference]: Without dead ends: 15000 [2019-11-28 18:19:47,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:19:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-11-28 18:19:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-11-28 18:19:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-11-28 18:19:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-11-28 18:19:48,086 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-11-28 18:19:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:48,088 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-11-28 18:19:48,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-11-28 18:19:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:19:48,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:48,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:48,093 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-11-28 18:19:48,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:48,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421718460] [2019-11-28 18:19:48,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:48,159 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:19:48,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421718460] [2019-11-28 18:19:48,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:48,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:48,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141850230] [2019-11-28 18:19:48,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:48,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:48,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:48,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:48,161 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-11-28 18:19:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:48,224 INFO L93 Difference]: Finished difference Result 11886 states and 36968 transitions. [2019-11-28 18:19:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:48,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:19:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:48,273 INFO L225 Difference]: With dead ends: 11886 [2019-11-28 18:19:48,274 INFO L226 Difference]: Without dead ends: 11886 [2019-11-28 18:19:48,274 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:19:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11886 states. [2019-11-28 18:19:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11886 to 11798. [2019-11-28 18:19:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11798 states. [2019-11-28 18:19:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11798 states to 11798 states and 36712 transitions. [2019-11-28 18:19:48,786 INFO L78 Accepts]: Start accepts. Automaton has 11798 states and 36712 transitions. Word has length 16 [2019-11-28 18:19:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:48,786 INFO L462 AbstractCegarLoop]: Abstraction has 11798 states and 36712 transitions. [2019-11-28 18:19:48,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 11798 states and 36712 transitions. [2019-11-28 18:19:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:19:48,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:48,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:48,790 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1560475965, now seen corresponding path program 1 times [2019-11-28 18:19:48,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:48,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069411354] [2019-11-28 18:19:48,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:48,866 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:19:48,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069411354] [2019-11-28 18:19:48,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:48,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:19:48,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944974812] [2019-11-28 18:19:48,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:48,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:48,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:48,869 INFO L87 Difference]: Start difference. First operand 11798 states and 36712 transitions. Second operand 3 states. [2019-11-28 18:19:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:48,929 INFO L93 Difference]: Finished difference Result 11795 states and 36703 transitions. [2019-11-28 18:19:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:48,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:19:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:48,981 INFO L225 Difference]: With dead ends: 11795 [2019-11-28 18:19:48,981 INFO L226 Difference]: Without dead ends: 11795 [2019-11-28 18:19:48,982 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:19:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11795 states. [2019-11-28 18:19:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11795 to 11795. [2019-11-28 18:19:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11795 states. [2019-11-28 18:19:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11795 states to 11795 states and 36703 transitions. [2019-11-28 18:19:49,320 INFO L78 Accepts]: Start accepts. Automaton has 11795 states and 36703 transitions. Word has length 16 [2019-11-28 18:19:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:49,320 INFO L462 AbstractCegarLoop]: Abstraction has 11795 states and 36703 transitions. [2019-11-28 18:19:49,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11795 states and 36703 transitions. [2019-11-28 18:19:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:19:49,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:49,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:49,329 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-11-28 18:19:49,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:49,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889232655] [2019-11-28 18:19:49,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:49,418 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:19:49,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889232655] [2019-11-28 18:19:49,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:49,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:49,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768836191] [2019-11-28 18:19:49,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:49,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:49,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:49,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:49,421 INFO L87 Difference]: Start difference. First operand 11795 states and 36703 transitions. Second operand 4 states. [2019-11-28 18:19:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:49,454 INFO L93 Difference]: Finished difference Result 2202 states and 5524 transitions. [2019-11-28 18:19:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:19:49,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:19:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:49,459 INFO L225 Difference]: With dead ends: 2202 [2019-11-28 18:19:49,460 INFO L226 Difference]: Without dead ends: 1544 [2019-11-28 18:19:49,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 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:19:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-11-28 18:19:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2019-11-28 18:19:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-11-28 18:19:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 3419 transitions. [2019-11-28 18:19:49,485 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 3419 transitions. Word has length 17 [2019-11-28 18:19:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:49,485 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 3419 transitions. [2019-11-28 18:19:49,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 3419 transitions. [2019-11-28 18:19:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:19:49,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:49,488 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] [2019-11-28 18:19:49,488 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-11-28 18:19:49,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:49,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766560669] [2019-11-28 18:19:49,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:49,584 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:19:49,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766560669] [2019-11-28 18:19:49,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:49,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:19:49,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905298321] [2019-11-28 18:19:49,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:19:49,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:49,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:19:49,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:19:49,587 INFO L87 Difference]: Start difference. First operand 1544 states and 3419 transitions. Second operand 6 states. [2019-11-28 18:19:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:49,947 INFO L93 Difference]: Finished difference Result 2374 states and 5046 transitions. [2019-11-28 18:19:49,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:19:49,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:19:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:49,952 INFO L225 Difference]: With dead ends: 2374 [2019-11-28 18:19:49,952 INFO L226 Difference]: Without dead ends: 2323 [2019-11-28 18:19:49,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:19:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-11-28 18:19:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1516. [2019-11-28 18:19:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-11-28 18:19:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3357 transitions. [2019-11-28 18:19:49,983 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3357 transitions. Word has length 25 [2019-11-28 18:19:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:49,983 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 3357 transitions. [2019-11-28 18:19:49,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:19:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3357 transitions. [2019-11-28 18:19:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:19:49,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:49,986 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] [2019-11-28 18:19:49,986 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2030434196, now seen corresponding path program 1 times [2019-11-28 18:19:49,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:49,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520897942] [2019-11-28 18:19:49,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:50,069 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:19:50,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520897942] [2019-11-28 18:19:50,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:50,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:50,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969881684] [2019-11-28 18:19:50,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:50,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:50,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:50,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:50,071 INFO L87 Difference]: Start difference. First operand 1516 states and 3357 transitions. Second operand 3 states. [2019-11-28 18:19:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:50,094 INFO L93 Difference]: Finished difference Result 2521 states and 5599 transitions. [2019-11-28 18:19:50,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:50,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 18:19:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:50,099 INFO L225 Difference]: With dead ends: 2521 [2019-11-28 18:19:50,099 INFO L226 Difference]: Without dead ends: 2046 [2019-11-28 18:19:50,100 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:19:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2019-11-28 18:19:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2017. [2019-11-28 18:19:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-11-28 18:19:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 4535 transitions. [2019-11-28 18:19:50,134 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 4535 transitions. Word has length 27 [2019-11-28 18:19:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:50,134 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 4535 transitions. [2019-11-28 18:19:50,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 4535 transitions. [2019-11-28 18:19:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:19:50,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:50,138 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] [2019-11-28 18:19:50,138 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-11-28 18:19:50,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:50,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670936809] [2019-11-28 18:19:50,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:50,261 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:19:50,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670936809] [2019-11-28 18:19:50,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:50,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:19:50,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681098597] [2019-11-28 18:19:50,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:50,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:50,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:50,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:50,263 INFO L87 Difference]: Start difference. First operand 2017 states and 4535 transitions. Second operand 5 states. [2019-11-28 18:19:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:50,304 INFO L93 Difference]: Finished difference Result 1101 states and 2460 transitions. [2019-11-28 18:19:50,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:50,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:19:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:50,307 INFO L225 Difference]: With dead ends: 1101 [2019-11-28 18:19:50,307 INFO L226 Difference]: Without dead ends: 983 [2019-11-28 18:19:50,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:19:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-11-28 18:19:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 707. [2019-11-28 18:19:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-11-28 18:19:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1554 transitions. [2019-11-28 18:19:50,320 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1554 transitions. Word has length 28 [2019-11-28 18:19:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:50,321 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1554 transitions. [2019-11-28 18:19:50,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1554 transitions. [2019-11-28 18:19:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:19:50,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:50,324 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:19:50,324 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:50,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-11-28 18:19:50,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:50,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394340150] [2019-11-28 18:19:50,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:50,375 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:19:50,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394340150] [2019-11-28 18:19:50,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:50,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:50,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050290626] [2019-11-28 18:19:50,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:50,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:50,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:50,377 INFO L87 Difference]: Start difference. First operand 707 states and 1554 transitions. Second operand 3 states. [2019-11-28 18:19:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:50,421 INFO L93 Difference]: Finished difference Result 1066 states and 2274 transitions. [2019-11-28 18:19:50,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:50,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:19:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:50,423 INFO L225 Difference]: With dead ends: 1066 [2019-11-28 18:19:50,424 INFO L226 Difference]: Without dead ends: 1066 [2019-11-28 18:19:50,424 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:19:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-11-28 18:19:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 806. [2019-11-28 18:19:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-11-28 18:19:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1751 transitions. [2019-11-28 18:19:50,439 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1751 transitions. Word has length 52 [2019-11-28 18:19:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:50,439 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1751 transitions. [2019-11-28 18:19:50,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1751 transitions. [2019-11-28 18:19:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:19:50,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:50,443 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:19:50,443 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:50,443 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-11-28 18:19:50,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:50,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167302978] [2019-11-28 18:19:50,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:50,511 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:19:50,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167302978] [2019-11-28 18:19:50,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:50,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:50,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551728656] [2019-11-28 18:19:50,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:50,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:50,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:50,514 INFO L87 Difference]: Start difference. First operand 806 states and 1751 transitions. Second operand 3 states. [2019-11-28 18:19:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:50,565 INFO L93 Difference]: Finished difference Result 1015 states and 2185 transitions. [2019-11-28 18:19:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:50,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:19:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:50,567 INFO L225 Difference]: With dead ends: 1015 [2019-11-28 18:19:50,567 INFO L226 Difference]: Without dead ends: 1015 [2019-11-28 18:19:50,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:19:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-28 18:19:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 782. [2019-11-28 18:19:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-28 18:19:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1716 transitions. [2019-11-28 18:19:50,585 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1716 transitions. Word has length 52 [2019-11-28 18:19:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:50,586 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1716 transitions. [2019-11-28 18:19:50,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1716 transitions. [2019-11-28 18:19:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:50,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:50,589 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:19:50,590 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:50,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash -802094331, now seen corresponding path program 1 times [2019-11-28 18:19:50,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:50,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802164910] [2019-11-28 18:19:50,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:50,718 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:19:50,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802164910] [2019-11-28 18:19:50,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:50,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:19:50,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721833362] [2019-11-28 18:19:50,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:19:50,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:50,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:19:50,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:19:50,721 INFO L87 Difference]: Start difference. First operand 782 states and 1716 transitions. Second operand 7 states. [2019-11-28 18:19:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:51,114 INFO L93 Difference]: Finished difference Result 2391 states and 5101 transitions. [2019-11-28 18:19:51,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:19:51,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:19:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:51,117 INFO L225 Difference]: With dead ends: 2391 [2019-11-28 18:19:51,117 INFO L226 Difference]: Without dead ends: 1663 [2019-11-28 18:19:51,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:19:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-11-28 18:19:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 880. [2019-11-28 18:19:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-11-28 18:19:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1916 transitions. [2019-11-28 18:19:51,138 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1916 transitions. Word has length 53 [2019-11-28 18:19:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:51,139 INFO L462 AbstractCegarLoop]: Abstraction has 880 states and 1916 transitions. [2019-11-28 18:19:51,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:19:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1916 transitions. [2019-11-28 18:19:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:51,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:51,142 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:19:51,142 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 2 times [2019-11-28 18:19:51,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:51,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121822746] [2019-11-28 18:19:51,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:19:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:19:51,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:19:51,272 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:19:51,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1449~0.base_35|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35| 1)) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= 0 |v_ULTIMATE.start_main_~#t1449~0.offset_27|) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1449~0.base_35| 4)) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35|)) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35|) |v_ULTIMATE.start_main_~#t1449~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1449~0.base=|v_ULTIMATE.start_main_~#t1449~0.base_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ULTIMATE.start_main_~#t1449~0.offset=|v_ULTIMATE.start_main_~#t1449~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t1449~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1450~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1449~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:19:51,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff1_thd2~0_Out1287167763 ~y$r_buff0_thd2~0_In1287167763) (= ~y$r_buff1_thd1~0_Out1287167763 ~y$r_buff0_thd1~0_In1287167763) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1287167763)) (= ~y$r_buff1_thd0~0_Out1287167763 ~y$r_buff0_thd0~0_In1287167763) (= ~x~0_Out1287167763 1) (= 1 ~y$r_buff0_thd1~0_Out1287167763)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1287167763, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1287167763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1287167763, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1287167763} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1287167763, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1287167763, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1287167763, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1287167763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1287167763, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1287167763, ~x~0=~x~0_Out1287167763, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1287167763} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:19:51,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1450~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1450~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|) |v_ULTIMATE.start_main_~#t1450~0.offset_10| 1)) |v_#memory_int_7|) (not (= |v_ULTIMATE.start_main_~#t1450~0.base_11| 0)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1450~0.base] because there is no mapped edge [2019-11-28 18:19:51,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In99804355 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In99804355 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out99804355| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out99804355| ~y$w_buff0_used~0_In99804355)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In99804355, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In99804355} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out99804355|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In99804355, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In99804355} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:19:51,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-64567315 256)))) (or (and (not .cse0) (= ~y$w_buff0~0_In-64567315 |P1Thread1of1ForFork1_#t~ite15_Out-64567315|) (= |P1Thread1of1ForFork1_#t~ite14_In-64567315| |P1Thread1of1ForFork1_#t~ite14_Out-64567315|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-64567315 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-64567315 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-64567315 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-64567315 256)))) (= ~y$w_buff0~0_In-64567315 |P1Thread1of1ForFork1_#t~ite14_Out-64567315|) (= |P1Thread1of1ForFork1_#t~ite15_Out-64567315| |P1Thread1of1ForFork1_#t~ite14_Out-64567315|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-64567315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64567315, ~y$w_buff0~0=~y$w_buff0~0_In-64567315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-64567315, ~weak$$choice2~0=~weak$$choice2~0_In-64567315, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-64567315|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64567315} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-64567315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64567315, ~y$w_buff0~0=~y$w_buff0~0_In-64567315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-64567315, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-64567315|, ~weak$$choice2~0=~weak$$choice2~0_In-64567315, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-64567315|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64567315} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:19:51,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1449202261 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1449202261| ~y$w_buff0_used~0_In-1449202261) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1449202261| |P1Thread1of1ForFork1_#t~ite20_Out-1449202261|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1449202261 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1449202261 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1449202261 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1449202261 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1449202261| |P1Thread1of1ForFork1_#t~ite20_Out-1449202261|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1449202261| ~y$w_buff0_used~0_In-1449202261) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1449202261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449202261, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1449202261|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1449202261, ~weak$$choice2~0=~weak$$choice2~0_In-1449202261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449202261} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1449202261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449202261, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1449202261|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1449202261, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1449202261|, ~weak$$choice2~0=~weak$$choice2~0_In-1449202261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449202261} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:19:51,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:19:51,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1585933457 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1585933457 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1585933457 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1585933457 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1585933457 256))))) (= ~y$r_buff1_thd2~0_In1585933457 |P1Thread1of1ForFork1_#t~ite29_Out1585933457|) (= |P1Thread1of1ForFork1_#t~ite30_Out1585933457| |P1Thread1of1ForFork1_#t~ite29_Out1585933457|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In1585933457| |P1Thread1of1ForFork1_#t~ite29_Out1585933457|) (= ~y$r_buff1_thd2~0_In1585933457 |P1Thread1of1ForFork1_#t~ite30_Out1585933457|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1585933457, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1585933457|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1585933457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1585933457, ~weak$$choice2~0=~weak$$choice2~0_In1585933457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1585933457} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1585933457, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1585933457|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1585933457|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1585933457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1585933457, ~weak$$choice2~0=~weak$$choice2~0_In1585933457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1585933457} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:19:51,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:19:51,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1411738299 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1411738299 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-1411738299| |P1Thread1of1ForFork1_#t~ite32_Out-1411738299|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1411738299| ~y$w_buff1~0_In-1411738299) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-1411738299| ~y~0_In-1411738299) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1411738299, ~y$w_buff1~0=~y$w_buff1~0_In-1411738299, ~y~0=~y~0_In-1411738299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1411738299} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1411738299, ~y$w_buff1~0=~y$w_buff1~0_In-1411738299, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1411738299|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1411738299|, ~y~0=~y~0_In-1411738299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1411738299} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:19:51,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1457040550 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1457040550 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1457040550| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1457040550| ~y$w_buff0_used~0_In1457040550) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1457040550, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1457040550} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1457040550, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1457040550, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1457040550|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:19:51,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In666683590 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In666683590 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In666683590 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In666683590 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out666683590| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out666683590| ~y$w_buff1_used~0_In666683590) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In666683590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666683590, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666683590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In666683590} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In666683590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666683590, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666683590, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out666683590|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In666683590} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:19:51,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-710787013 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-710787013 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-710787013|)) (and (= ~y$r_buff0_thd2~0_In-710787013 |P1Thread1of1ForFork1_#t~ite36_Out-710787013|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-710787013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-710787013} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-710787013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-710787013, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-710787013|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:19:51,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1001660322 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1001660322 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1001660322 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1001660322 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1001660322|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1001660322 |P1Thread1of1ForFork1_#t~ite37_Out1001660322|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1001660322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1001660322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1001660322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1001660322} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1001660322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1001660322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1001660322, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1001660322|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1001660322} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:51,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:51,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-101417970 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-101417970 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-101417970 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-101417970 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-101417970|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-101417970 |P0Thread1of1ForFork0_#t~ite6_Out-101417970|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-101417970, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101417970, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-101417970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101417970} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-101417970|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-101417970, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101417970, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-101417970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101417970} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:19:51,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1874840376 256))) (.cse0 (= ~y$r_buff0_thd1~0_Out-1874840376 ~y$r_buff0_thd1~0_In-1874840376)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1874840376 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~y$r_buff0_thd1~0_Out-1874840376 0)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874840376, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1874840376} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874840376, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1874840376|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1874840376} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:19:51,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-759420746 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-759420746 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-759420746 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-759420746 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-759420746 |P0Thread1of1ForFork0_#t~ite8_Out-759420746|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-759420746|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-759420746, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-759420746, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-759420746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-759420746} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-759420746, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-759420746, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-759420746|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-759420746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-759420746} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:19:51,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:19:51,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:19:51,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-2042685201| |ULTIMATE.start_main_#t~ite40_Out-2042685201|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2042685201 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2042685201 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite40_Out-2042685201| ~y$w_buff1~0_In-2042685201)) (and (= |ULTIMATE.start_main_#t~ite40_Out-2042685201| ~y~0_In-2042685201) .cse0 (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2042685201, ~y~0=~y~0_In-2042685201, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2042685201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2042685201} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2042685201|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2042685201|, ~y$w_buff1~0=~y$w_buff1~0_In-2042685201, ~y~0=~y~0_In-2042685201, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2042685201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2042685201} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:19:51,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In372821735 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In372821735 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out372821735| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In372821735 |ULTIMATE.start_main_#t~ite42_Out372821735|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In372821735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In372821735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In372821735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In372821735, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out372821735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:19:51,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In112809775 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In112809775 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In112809775 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In112809775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out112809775|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In112809775 |ULTIMATE.start_main_#t~ite43_Out112809775|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In112809775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In112809775, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In112809775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In112809775} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In112809775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In112809775, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out112809775|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In112809775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In112809775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:19:51,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2142462432 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2142462432 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out2142462432| ~y$r_buff0_thd0~0_In2142462432)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out2142462432| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2142462432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2142462432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2142462432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2142462432, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2142462432|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:19:51,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-622186822 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-622186822 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-622186822 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-622186822 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-622186822|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-622186822 |ULTIMATE.start_main_#t~ite45_Out-622186822|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-622186822, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622186822, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622186822, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622186822} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-622186822, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622186822, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622186822, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-622186822|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622186822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:19:51,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:19:51,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:19:51 BasicIcfg [2019-11-28 18:19:51,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:19:51,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:19:51,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:19:51,410 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:19:51,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:37" (3/4) ... [2019-11-28 18:19:51,415 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:19:51,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1449~0.base_35|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35| 1)) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= 0 |v_ULTIMATE.start_main_~#t1449~0.offset_27|) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1449~0.base_35| 4)) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35|)) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35|) |v_ULTIMATE.start_main_~#t1449~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1449~0.base=|v_ULTIMATE.start_main_~#t1449~0.base_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ULTIMATE.start_main_~#t1449~0.offset=|v_ULTIMATE.start_main_~#t1449~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t1449~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1450~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1449~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:19:51,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff1_thd2~0_Out1287167763 ~y$r_buff0_thd2~0_In1287167763) (= ~y$r_buff1_thd1~0_Out1287167763 ~y$r_buff0_thd1~0_In1287167763) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1287167763)) (= ~y$r_buff1_thd0~0_Out1287167763 ~y$r_buff0_thd0~0_In1287167763) (= ~x~0_Out1287167763 1) (= 1 ~y$r_buff0_thd1~0_Out1287167763)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1287167763, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1287167763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1287167763, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1287167763} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1287167763, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1287167763, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1287167763, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1287167763, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1287167763, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1287167763, ~x~0=~x~0_Out1287167763, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1287167763} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:19:51,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1450~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1450~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|) |v_ULTIMATE.start_main_~#t1450~0.offset_10| 1)) |v_#memory_int_7|) (not (= |v_ULTIMATE.start_main_~#t1450~0.base_11| 0)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1450~0.base] because there is no mapped edge [2019-11-28 18:19:51,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In99804355 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In99804355 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out99804355| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out99804355| ~y$w_buff0_used~0_In99804355)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In99804355, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In99804355} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out99804355|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In99804355, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In99804355} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:19:51,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-64567315 256)))) (or (and (not .cse0) (= ~y$w_buff0~0_In-64567315 |P1Thread1of1ForFork1_#t~ite15_Out-64567315|) (= |P1Thread1of1ForFork1_#t~ite14_In-64567315| |P1Thread1of1ForFork1_#t~ite14_Out-64567315|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-64567315 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-64567315 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-64567315 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-64567315 256)))) (= ~y$w_buff0~0_In-64567315 |P1Thread1of1ForFork1_#t~ite14_Out-64567315|) (= |P1Thread1of1ForFork1_#t~ite15_Out-64567315| |P1Thread1of1ForFork1_#t~ite14_Out-64567315|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-64567315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64567315, ~y$w_buff0~0=~y$w_buff0~0_In-64567315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-64567315, ~weak$$choice2~0=~weak$$choice2~0_In-64567315, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-64567315|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64567315} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-64567315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64567315, ~y$w_buff0~0=~y$w_buff0~0_In-64567315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-64567315, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-64567315|, ~weak$$choice2~0=~weak$$choice2~0_In-64567315, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-64567315|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64567315} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:19:51,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1449202261 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1449202261| ~y$w_buff0_used~0_In-1449202261) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1449202261| |P1Thread1of1ForFork1_#t~ite20_Out-1449202261|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1449202261 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1449202261 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1449202261 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1449202261 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1449202261| |P1Thread1of1ForFork1_#t~ite20_Out-1449202261|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1449202261| ~y$w_buff0_used~0_In-1449202261) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1449202261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449202261, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1449202261|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1449202261, ~weak$$choice2~0=~weak$$choice2~0_In-1449202261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449202261} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1449202261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449202261, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1449202261|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1449202261, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1449202261|, ~weak$$choice2~0=~weak$$choice2~0_In-1449202261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449202261} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:19:51,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:19:51,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1585933457 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1585933457 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1585933457 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1585933457 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1585933457 256))))) (= ~y$r_buff1_thd2~0_In1585933457 |P1Thread1of1ForFork1_#t~ite29_Out1585933457|) (= |P1Thread1of1ForFork1_#t~ite30_Out1585933457| |P1Thread1of1ForFork1_#t~ite29_Out1585933457|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In1585933457| |P1Thread1of1ForFork1_#t~ite29_Out1585933457|) (= ~y$r_buff1_thd2~0_In1585933457 |P1Thread1of1ForFork1_#t~ite30_Out1585933457|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1585933457, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1585933457|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1585933457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1585933457, ~weak$$choice2~0=~weak$$choice2~0_In1585933457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1585933457} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1585933457, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1585933457|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1585933457|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1585933457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1585933457, ~weak$$choice2~0=~weak$$choice2~0_In1585933457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1585933457} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:19:51,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:19:51,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1411738299 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1411738299 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-1411738299| |P1Thread1of1ForFork1_#t~ite32_Out-1411738299|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1411738299| ~y$w_buff1~0_In-1411738299) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-1411738299| ~y~0_In-1411738299) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1411738299, ~y$w_buff1~0=~y$w_buff1~0_In-1411738299, ~y~0=~y~0_In-1411738299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1411738299} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1411738299, ~y$w_buff1~0=~y$w_buff1~0_In-1411738299, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1411738299|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1411738299|, ~y~0=~y~0_In-1411738299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1411738299} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:19:51,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1457040550 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1457040550 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1457040550| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1457040550| ~y$w_buff0_used~0_In1457040550) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1457040550, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1457040550} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1457040550, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1457040550, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1457040550|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:19:51,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In666683590 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In666683590 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In666683590 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In666683590 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out666683590| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out666683590| ~y$w_buff1_used~0_In666683590) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In666683590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666683590, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666683590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In666683590} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In666683590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In666683590, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666683590, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out666683590|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In666683590} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:19:51,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-710787013 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-710787013 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-710787013|)) (and (= ~y$r_buff0_thd2~0_In-710787013 |P1Thread1of1ForFork1_#t~ite36_Out-710787013|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-710787013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-710787013} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-710787013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-710787013, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-710787013|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:19:51,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1001660322 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1001660322 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1001660322 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1001660322 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1001660322|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1001660322 |P1Thread1of1ForFork1_#t~ite37_Out1001660322|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1001660322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1001660322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1001660322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1001660322} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1001660322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1001660322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1001660322, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1001660322|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1001660322} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:51,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:51,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-101417970 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-101417970 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-101417970 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-101417970 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-101417970|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-101417970 |P0Thread1of1ForFork0_#t~ite6_Out-101417970|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-101417970, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101417970, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-101417970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101417970} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-101417970|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-101417970, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101417970, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-101417970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101417970} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:19:51,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1874840376 256))) (.cse0 (= ~y$r_buff0_thd1~0_Out-1874840376 ~y$r_buff0_thd1~0_In-1874840376)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1874840376 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~y$r_buff0_thd1~0_Out-1874840376 0)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874840376, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1874840376} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874840376, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1874840376|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1874840376} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:19:51,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-759420746 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-759420746 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-759420746 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-759420746 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-759420746 |P0Thread1of1ForFork0_#t~ite8_Out-759420746|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-759420746|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-759420746, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-759420746, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-759420746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-759420746} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-759420746, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-759420746, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-759420746|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-759420746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-759420746} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:19:51,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:19:51,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:19:51,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-2042685201| |ULTIMATE.start_main_#t~ite40_Out-2042685201|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2042685201 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2042685201 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite40_Out-2042685201| ~y$w_buff1~0_In-2042685201)) (and (= |ULTIMATE.start_main_#t~ite40_Out-2042685201| ~y~0_In-2042685201) .cse0 (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2042685201, ~y~0=~y~0_In-2042685201, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2042685201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2042685201} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2042685201|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2042685201|, ~y$w_buff1~0=~y$w_buff1~0_In-2042685201, ~y~0=~y~0_In-2042685201, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2042685201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2042685201} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:19:51,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In372821735 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In372821735 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out372821735| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In372821735 |ULTIMATE.start_main_#t~ite42_Out372821735|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In372821735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In372821735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In372821735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In372821735, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out372821735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:19:51,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In112809775 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In112809775 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In112809775 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In112809775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out112809775|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In112809775 |ULTIMATE.start_main_#t~ite43_Out112809775|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In112809775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In112809775, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In112809775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In112809775} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In112809775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In112809775, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out112809775|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In112809775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In112809775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:19:51,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2142462432 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2142462432 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out2142462432| ~y$r_buff0_thd0~0_In2142462432)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out2142462432| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2142462432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2142462432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2142462432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2142462432, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2142462432|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:19:51,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-622186822 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-622186822 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-622186822 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-622186822 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-622186822|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-622186822 |ULTIMATE.start_main_#t~ite45_Out-622186822|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-622186822, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622186822, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622186822, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622186822} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-622186822, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622186822, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-622186822, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-622186822|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622186822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:19:51,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:19:51,582 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:19:51,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:19:51,589 INFO L168 Benchmark]: Toolchain (without parser) took 15422.82 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.5 MB). Free memory was 955.0 MB in the beginning and 1.3 GB in the end (delta: -321.0 MB). Peak memory consumption was 154.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:51,590 INFO L168 Benchmark]: CDTParser took 0.74 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:19:51,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:51,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.91 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:51,591 INFO L168 Benchmark]: Boogie Preprocessor took 43.58 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:19:51,592 INFO L168 Benchmark]: RCFGBuilder took 795.85 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: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:51,593 INFO L168 Benchmark]: TraceAbstraction took 13580.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -236.9 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:51,593 INFO L168 Benchmark]: Witness Printer took 175.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:51,596 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.74 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 753.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.91 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.58 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 795.85 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: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13580.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -236.9 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. * Witness Printer took 175.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1449 SDtfs, 1295 SDslu, 2549 SDs, 0 SdLazy, 953 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 6822 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 31201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...