./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ad75676076b2f4fd97a0e8b61d888447e8e32fb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:33:27,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:33:27,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:33:27,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:33:27,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:33:27,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:33:27,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:33:27,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:33:27,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:33:27,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:33:27,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:33:27,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:33:27,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:33:27,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:33:27,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:33:27,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:33:27,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:33:27,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:33:27,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:33:27,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:33:27,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:33:27,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:33:27,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:33:27,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:33:27,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:33:27,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:33:27,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:33:27,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:33:27,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:33:27,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:33:27,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:33:27,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:33:27,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:33:27,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:33:27,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:33:27,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:33:27,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:33:27,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:33:27,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:33:27,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:33:27,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:33:27,828 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:33:27,844 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:33:27,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:33:27,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:33:27,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:33:27,847 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:33:27,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:33:27,848 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:33:27,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:33:27,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:33:27,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:33:27,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:33:27,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:33:27,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:33:27,850 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:33:27,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:33:27,850 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:33:27,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:33:27,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:33:27,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:33:27,852 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:33:27,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:33:27,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:33:27,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:33:27,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:33:27,853 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:33:27,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:33:27,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:33:27,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:33:27,854 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:33:27,854 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 -> 0ad75676076b2f4fd97a0e8b61d888447e8e32fb [2019-11-28 18:33:28,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:33:28,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:33:28,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:33:28,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:33:28,217 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:33:28,218 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i [2019-11-28 18:33:28,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ca24a06/1e93a68b4f5d4bf1981ad56a656062f6/FLAG1f51d10cb [2019-11-28 18:33:28,862 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:33:28,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe033_power.opt.i [2019-11-28 18:33:28,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ca24a06/1e93a68b4f5d4bf1981ad56a656062f6/FLAG1f51d10cb [2019-11-28 18:33:29,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ca24a06/1e93a68b4f5d4bf1981ad56a656062f6 [2019-11-28 18:33:29,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:33:29,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:33:29,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:29,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:33:29,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:33:29,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:29,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29, skipping insertion in model container [2019-11-28 18:33:29,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:29,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:33:29,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:33:29,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:29,717 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:33:29,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:29,896 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:33:29,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29 WrapperNode [2019-11-28 18:33:29,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:29,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:29,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:33:29,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:33:29,907 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:33:29" (1/1) ... [2019-11-28 18:33:29,934 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:33:29" (1/1) ... [2019-11-28 18:33:29,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:29,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:33:29,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:33:29,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:33:29,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:29,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:29,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:29,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:30,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:30,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:30,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (1/1) ... [2019-11-28 18:33:30,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:33:30,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:33:30,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:33:30,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:33:30,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (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:33:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:33:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:33:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:33:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:33:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:33:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:33:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:33:30,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:33:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:33:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:33:30,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:33:30,087 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:33:30,752 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:33:30,752 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:33:30,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:30 BoogieIcfgContainer [2019-11-28 18:33:30,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:33:30,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:33:30,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:33:30,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:33:30,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:33:29" (1/3) ... [2019-11-28 18:33:30,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f704c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:30, skipping insertion in model container [2019-11-28 18:33:30,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:29" (2/3) ... [2019-11-28 18:33:30,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f704c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:30, skipping insertion in model container [2019-11-28 18:33:30,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:30" (3/3) ... [2019-11-28 18:33:30,765 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.opt.i [2019-11-28 18:33:30,776 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:33:30,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:33:30,790 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:33:30,791 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:33:30,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,848 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,849 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:30,927 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:33:30,949 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:33:30,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:33:30,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:33:30,950 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:33:30,950 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:33:30,950 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:33:30,950 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:33:30,951 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:33:30,969 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-11-28 18:33:30,971 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-11-28 18:33:31,083 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-11-28 18:33:31,083 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:31,104 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:33:31,124 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-11-28 18:33:31,188 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-11-28 18:33:31,188 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:31,196 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:33:31,211 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:33:31,213 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:33:35,588 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-11-28 18:33:35,726 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 18:33:35,891 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-11-28 18:33:35,892 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-11-28 18:33:35,896 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-11-28 18:33:36,300 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-11-28 18:33:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-11-28 18:33:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:33:36,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:36,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:33:36,313 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-11-28 18:33:36,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:36,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585314500] [2019-11-28 18:33:36,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:36,730 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:33:36,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585314500] [2019-11-28 18:33:36,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:36,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:33:36,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435155448] [2019-11-28 18:33:36,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:36,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:36,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:36,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:36,770 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-11-28 18:33:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:37,083 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-11-28 18:33:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:37,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:33:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:37,175 INFO L225 Difference]: With dead ends: 6240 [2019-11-28 18:33:37,175 INFO L226 Difference]: Without dead ends: 5850 [2019-11-28 18:33:37,182 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:33:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-11-28 18:33:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-11-28 18:33:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-11-28 18:33:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-11-28 18:33:37,541 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-11-28 18:33:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:37,541 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-11-28 18:33:37,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-11-28 18:33:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:33:37,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:37,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:37,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:37,545 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-11-28 18:33:37,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:37,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147981823] [2019-11-28 18:33:37,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:37,619 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:33:37,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147981823] [2019-11-28 18:33:37,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:37,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:37,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604822282] [2019-11-28 18:33:37,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:37,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:37,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:37,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:37,623 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 4 states. [2019-11-28 18:33:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:38,000 INFO L93 Difference]: Finished difference Result 9088 states and 29317 transitions. [2019-11-28 18:33:38,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:38,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:33:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:38,108 INFO L225 Difference]: With dead ends: 9088 [2019-11-28 18:33:38,108 INFO L226 Difference]: Without dead ends: 9073 [2019-11-28 18:33:38,109 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:33:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2019-11-28 18:33:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 8163. [2019-11-28 18:33:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8163 states. [2019-11-28 18:33:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 26811 transitions. [2019-11-28 18:33:38,473 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 26811 transitions. Word has length 11 [2019-11-28 18:33:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:38,473 INFO L462 AbstractCegarLoop]: Abstraction has 8163 states and 26811 transitions. [2019-11-28 18:33:38,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 26811 transitions. [2019-11-28 18:33:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:38,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:38,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:38,483 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-11-28 18:33:38,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:38,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344571447] [2019-11-28 18:33:38,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:38,581 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:33:38,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344571447] [2019-11-28 18:33:38,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:38,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:38,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148905953] [2019-11-28 18:33:38,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:38,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:38,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:38,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:38,584 INFO L87 Difference]: Start difference. First operand 8163 states and 26811 transitions. Second operand 3 states. [2019-11-28 18:33:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:38,779 INFO L93 Difference]: Finished difference Result 10304 states and 33095 transitions. [2019-11-28 18:33:38,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:38,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:33:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:38,831 INFO L225 Difference]: With dead ends: 10304 [2019-11-28 18:33:38,831 INFO L226 Difference]: Without dead ends: 10304 [2019-11-28 18:33:38,832 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:33:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10304 states. [2019-11-28 18:33:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10304 to 8837. [2019-11-28 18:33:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2019-11-28 18:33:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 28865 transitions. [2019-11-28 18:33:39,255 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 28865 transitions. Word has length 14 [2019-11-28 18:33:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:39,255 INFO L462 AbstractCegarLoop]: Abstraction has 8837 states and 28865 transitions. [2019-11-28 18:33:39,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 28865 transitions. [2019-11-28 18:33:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:39,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:39,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:39,258 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-11-28 18:33:39,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:39,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948558304] [2019-11-28 18:33:39,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:39,325 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:33:39,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948558304] [2019-11-28 18:33:39,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:39,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:39,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503573150] [2019-11-28 18:33:39,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:39,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:39,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:39,327 INFO L87 Difference]: Start difference. First operand 8837 states and 28865 transitions. Second operand 4 states. [2019-11-28 18:33:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:39,517 INFO L93 Difference]: Finished difference Result 10707 states and 34201 transitions. [2019-11-28 18:33:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:39,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:33:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:39,555 INFO L225 Difference]: With dead ends: 10707 [2019-11-28 18:33:39,555 INFO L226 Difference]: Without dead ends: 10697 [2019-11-28 18:33:39,556 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:33:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2019-11-28 18:33:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 9298. [2019-11-28 18:33:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9298 states. [2019-11-28 18:33:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 30231 transitions. [2019-11-28 18:33:39,900 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 30231 transitions. Word has length 14 [2019-11-28 18:33:39,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:39,900 INFO L462 AbstractCegarLoop]: Abstraction has 9298 states and 30231 transitions. [2019-11-28 18:33:39,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 30231 transitions. [2019-11-28 18:33:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:39,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:39,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:39,903 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-11-28 18:33:39,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:39,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505839724] [2019-11-28 18:33:39,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:39,945 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:33:39,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505839724] [2019-11-28 18:33:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:39,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455235215] [2019-11-28 18:33:39,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:39,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:39,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:39,947 INFO L87 Difference]: Start difference. First operand 9298 states and 30231 transitions. Second operand 4 states. [2019-11-28 18:33:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:40,160 INFO L93 Difference]: Finished difference Result 11850 states and 37991 transitions. [2019-11-28 18:33:40,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:40,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:33:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:40,211 INFO L225 Difference]: With dead ends: 11850 [2019-11-28 18:33:40,211 INFO L226 Difference]: Without dead ends: 11835 [2019-11-28 18:33:40,212 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:33:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2019-11-28 18:33:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 9707. [2019-11-28 18:33:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2019-11-28 18:33:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31642 transitions. [2019-11-28 18:33:40,542 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31642 transitions. Word has length 14 [2019-11-28 18:33:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:40,543 INFO L462 AbstractCegarLoop]: Abstraction has 9707 states and 31642 transitions. [2019-11-28 18:33:40,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31642 transitions. [2019-11-28 18:33:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:33:40,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:40,547 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:33:40,547 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:40,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:40,547 INFO L82 PathProgramCache]: Analyzing trace with hash -247442678, now seen corresponding path program 1 times [2019-11-28 18:33:40,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:40,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806691336] [2019-11-28 18:33:40,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:40,589 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:33:40,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806691336] [2019-11-28 18:33:40,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:40,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:40,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071966781] [2019-11-28 18:33:40,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:40,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:40,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:40,591 INFO L87 Difference]: Start difference. First operand 9707 states and 31642 transitions. Second operand 3 states. [2019-11-28 18:33:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:40,613 INFO L93 Difference]: Finished difference Result 1607 states and 3887 transitions. [2019-11-28 18:33:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:40,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:33:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:40,618 INFO L225 Difference]: With dead ends: 1607 [2019-11-28 18:33:40,618 INFO L226 Difference]: Without dead ends: 1607 [2019-11-28 18:33:40,619 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:33:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-11-28 18:33:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2019-11-28 18:33:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-11-28 18:33:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-11-28 18:33:40,653 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 16 [2019-11-28 18:33:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:40,654 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-11-28 18:33:40,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-11-28 18:33:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:33:40,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:40,657 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] [2019-11-28 18:33:40,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:40,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-11-28 18:33:40,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:40,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118285483] [2019-11-28 18:33:40,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:40,870 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:33:40,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118285483] [2019-11-28 18:33:40,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:40,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:40,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797046535] [2019-11-28 18:33:40,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:40,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:40,872 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-11-28 18:33:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:41,089 INFO L93 Difference]: Finished difference Result 2202 states and 5235 transitions. [2019-11-28 18:33:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:33:41,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:33:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:41,096 INFO L225 Difference]: With dead ends: 2202 [2019-11-28 18:33:41,096 INFO L226 Difference]: Without dead ends: 2200 [2019-11-28 18:33:41,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:33:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-11-28 18:33:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1723. [2019-11-28 18:33:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-28 18:33:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 4159 transitions. [2019-11-28 18:33:41,140 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 4159 transitions. Word has length 26 [2019-11-28 18:33:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:41,141 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 4159 transitions. [2019-11-28 18:33:41,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:33:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 4159 transitions. [2019-11-28 18:33:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:33:41,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:41,146 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] [2019-11-28 18:33:41,146 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash -344365836, now seen corresponding path program 1 times [2019-11-28 18:33:41,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:41,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277980293] [2019-11-28 18:33:41,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:41,187 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:33:41,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277980293] [2019-11-28 18:33:41,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:41,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:41,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047932330] [2019-11-28 18:33:41,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:41,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:41,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:41,189 INFO L87 Difference]: Start difference. First operand 1723 states and 4159 transitions. Second operand 3 states. [2019-11-28 18:33:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:41,231 INFO L93 Difference]: Finished difference Result 2209 states and 5197 transitions. [2019-11-28 18:33:41,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:41,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 18:33:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:41,237 INFO L225 Difference]: With dead ends: 2209 [2019-11-28 18:33:41,237 INFO L226 Difference]: Without dead ends: 2209 [2019-11-28 18:33:41,237 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:33:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2019-11-28 18:33:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1753. [2019-11-28 18:33:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-11-28 18:33:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 4059 transitions. [2019-11-28 18:33:41,272 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 4059 transitions. Word has length 26 [2019-11-28 18:33:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:41,273 INFO L462 AbstractCegarLoop]: Abstraction has 1753 states and 4059 transitions. [2019-11-28 18:33:41,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 4059 transitions. [2019-11-28 18:33:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:33:41,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:41,276 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] [2019-11-28 18:33:41,276 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:41,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:41,277 INFO L82 PathProgramCache]: Analyzing trace with hash -281839928, now seen corresponding path program 1 times [2019-11-28 18:33:41,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:41,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342967254] [2019-11-28 18:33:41,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:41,363 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:33:41,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342967254] [2019-11-28 18:33:41,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:41,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:33:41,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640089654] [2019-11-28 18:33:41,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:41,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:41,366 INFO L87 Difference]: Start difference. First operand 1753 states and 4059 transitions. Second operand 5 states. [2019-11-28 18:33:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:41,720 INFO L93 Difference]: Finished difference Result 2526 states and 5750 transitions. [2019-11-28 18:33:41,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:33:41,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:33:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:41,727 INFO L225 Difference]: With dead ends: 2526 [2019-11-28 18:33:41,727 INFO L226 Difference]: Without dead ends: 2526 [2019-11-28 18:33:41,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:33:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2019-11-28 18:33:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2091. [2019-11-28 18:33:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-11-28 18:33:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 4785 transitions. [2019-11-28 18:33:41,766 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 4785 transitions. Word has length 26 [2019-11-28 18:33:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:41,767 INFO L462 AbstractCegarLoop]: Abstraction has 2091 states and 4785 transitions. [2019-11-28 18:33:41,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:33:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 4785 transitions. [2019-11-28 18:33:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:33:41,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:41,771 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:33:41,771 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:41,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1359644488, now seen corresponding path program 1 times [2019-11-28 18:33:41,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:41,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144425310] [2019-11-28 18:33:41,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:41,820 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:33:41,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144425310] [2019-11-28 18:33:41,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:41,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:41,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200211155] [2019-11-28 18:33:41,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:41,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:41,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:41,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:41,823 INFO L87 Difference]: Start difference. First operand 2091 states and 4785 transitions. Second operand 4 states. [2019-11-28 18:33:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:41,847 INFO L93 Difference]: Finished difference Result 1065 states and 2228 transitions. [2019-11-28 18:33:41,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:33:41,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:33:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:41,851 INFO L225 Difference]: With dead ends: 1065 [2019-11-28 18:33:41,853 INFO L226 Difference]: Without dead ends: 1065 [2019-11-28 18:33:41,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-11-28 18:33:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 943. [2019-11-28 18:33:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-28 18:33:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1991 transitions. [2019-11-28 18:33:41,870 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1991 transitions. Word has length 27 [2019-11-28 18:33:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:41,871 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1991 transitions. [2019-11-28 18:33:41,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1991 transitions. [2019-11-28 18:33:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:41,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:41,877 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] [2019-11-28 18:33:41,877 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash 562189682, now seen corresponding path program 1 times [2019-11-28 18:33:41,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:41,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378993879] [2019-11-28 18:33:41,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,020 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:33:42,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378993879] [2019-11-28 18:33:42,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:33:42,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447007866] [2019-11-28 18:33:42,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:42,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:42,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:42,022 INFO L87 Difference]: Start difference. First operand 943 states and 1991 transitions. Second operand 5 states. [2019-11-28 18:33:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:42,143 INFO L93 Difference]: Finished difference Result 1146 states and 2377 transitions. [2019-11-28 18:33:42,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:33:42,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-28 18:33:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:42,146 INFO L225 Difference]: With dead ends: 1146 [2019-11-28 18:33:42,146 INFO L226 Difference]: Without dead ends: 1146 [2019-11-28 18:33:42,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:33:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2019-11-28 18:33:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 969. [2019-11-28 18:33:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-28 18:33:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2043 transitions. [2019-11-28 18:33:42,163 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2043 transitions. Word has length 41 [2019-11-28 18:33:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,163 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 2043 transitions. [2019-11-28 18:33:42,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:33:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2043 transitions. [2019-11-28 18:33:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:42,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,167 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] [2019-11-28 18:33:42,167 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2091375240, now seen corresponding path program 2 times [2019-11-28 18:33:42,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850913714] [2019-11-28 18:33:42,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,306 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:33:42,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850913714] [2019-11-28 18:33:42,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:42,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004177377] [2019-11-28 18:33:42,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:42,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:42,309 INFO L87 Difference]: Start difference. First operand 969 states and 2043 transitions. Second operand 3 states. [2019-11-28 18:33:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:42,324 INFO L93 Difference]: Finished difference Result 969 states and 2041 transitions. [2019-11-28 18:33:42,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:42,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 18:33:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:42,327 INFO L225 Difference]: With dead ends: 969 [2019-11-28 18:33:42,328 INFO L226 Difference]: Without dead ends: 969 [2019-11-28 18:33:42,329 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:33:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-11-28 18:33:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 823. [2019-11-28 18:33:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-11-28 18:33:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1760 transitions. [2019-11-28 18:33:42,343 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1760 transitions. Word has length 41 [2019-11-28 18:33:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,344 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1760 transitions. [2019-11-28 18:33:42,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1760 transitions. [2019-11-28 18:33:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:42,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,347 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] [2019-11-28 18:33:42,347 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1761581763, now seen corresponding path program 1 times [2019-11-28 18:33:42,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515290400] [2019-11-28 18:33:42,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,456 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:33:42,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515290400] [2019-11-28 18:33:42,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:42,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92677030] [2019-11-28 18:33:42,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:42,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:42,460 INFO L87 Difference]: Start difference. First operand 823 states and 1760 transitions. Second operand 3 states. [2019-11-28 18:33:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:42,471 INFO L93 Difference]: Finished difference Result 1428 states and 3075 transitions. [2019-11-28 18:33:42,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:42,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-28 18:33:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:42,473 INFO L225 Difference]: With dead ends: 1428 [2019-11-28 18:33:42,473 INFO L226 Difference]: Without dead ends: 633 [2019-11-28 18:33:42,473 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:33:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-11-28 18:33:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-11-28 18:33:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-11-28 18:33:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1363 transitions. [2019-11-28 18:33:42,483 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1363 transitions. Word has length 42 [2019-11-28 18:33:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,483 INFO L462 AbstractCegarLoop]: Abstraction has 633 states and 1363 transitions. [2019-11-28 18:33:42,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1363 transitions. [2019-11-28 18:33:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:42,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,485 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] [2019-11-28 18:33:42,486 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash 501545049, now seen corresponding path program 2 times [2019-11-28 18:33:42,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056800162] [2019-11-28 18:33:42,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,589 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:33:42,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056800162] [2019-11-28 18:33:42,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:33:42,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026278925] [2019-11-28 18:33:42,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:33:42,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:33:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:33:42,591 INFO L87 Difference]: Start difference. First operand 633 states and 1363 transitions. Second operand 6 states. [2019-11-28 18:33:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:42,796 INFO L93 Difference]: Finished difference Result 1026 states and 2144 transitions. [2019-11-28 18:33:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:33:42,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-28 18:33:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:42,798 INFO L225 Difference]: With dead ends: 1026 [2019-11-28 18:33:42,798 INFO L226 Difference]: Without dead ends: 699 [2019-11-28 18:33:42,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:33:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-11-28 18:33:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 657. [2019-11-28 18:33:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-28 18:33:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1390 transitions. [2019-11-28 18:33:42,813 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1390 transitions. Word has length 42 [2019-11-28 18:33:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,813 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1390 transitions. [2019-11-28 18:33:42,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:33:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1390 transitions. [2019-11-28 18:33:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:42,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,815 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] [2019-11-28 18:33:42,815 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,816 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 3 times [2019-11-28 18:33:42,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899269316] [2019-11-28 18:33:42,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:33:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:33:42,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:33:42,968 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:33:42,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2563~0.base_24| 4) |v_#length_15|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0) (= 0 v_~x$w_buff0~0_579) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24| 1)) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24|) 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2563~0.base=|v_ULTIMATE.start_main_~#t2563~0.base_24|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2563~0.offset=|v_ULTIMATE.start_main_~#t2563~0.offset_18|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_25|, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2563~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2564~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2563~0.offset, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2564~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:33:42,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11|) |v_ULTIMATE.start_main_~#t2564~0.offset_9| 1)) |v_#memory_int_5|) (not (= |v_ULTIMATE.start_main_~#t2564~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t2564~0.offset_9|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2564~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2564~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_11|, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2564~0.base, ULTIMATE.start_main_~#t2564~0.offset] because there is no mapped edge [2019-11-28 18:33:42,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:33:42,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1832829477 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out1832829477| ~x$w_buff0~0_In1832829477) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In1832829477| |P0Thread1of1ForFork1_#t~ite8_Out1832829477|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1832829477 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1832829477 256))) (= 0 (mod ~x$w_buff0_used~0_In1832829477 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1832829477 256))))) (= |P0Thread1of1ForFork1_#t~ite8_Out1832829477| |P0Thread1of1ForFork1_#t~ite9_Out1832829477|) .cse0 (= |P0Thread1of1ForFork1_#t~ite8_Out1832829477| ~x$w_buff0~0_In1832829477)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1832829477, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832829477, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In1832829477|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832829477, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832829477, ~weak$$choice2~0=~weak$$choice2~0_In1832829477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832829477} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1832829477, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832829477, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1832829477|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out1832829477|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832829477, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832829477, ~weak$$choice2~0=~weak$$choice2~0_In1832829477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832829477} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-11-28 18:33:42,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:33:42,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:33:42,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-418244067 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-418244067 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-418244067|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-418244067 |P1Thread1of1ForFork0_#t~ite28_Out-418244067|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-418244067, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418244067} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-418244067, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-418244067|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418244067} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:33:42,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1260259778 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1260259778 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1260259778 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1260259778 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1260259778|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1260259778 |P1Thread1of1ForFork0_#t~ite29_Out1260259778|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1260259778, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1260259778, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1260259778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1260259778} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1260259778, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1260259778, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1260259778, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1260259778|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1260259778} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:33:42,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1884631742 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_Out-1884631742 ~x$r_buff0_thd2~0_In-1884631742)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1884631742 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= ~x$r_buff0_thd2~0_Out-1884631742 0)) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1884631742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1884631742} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1884631742|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1884631742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1884631742} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:33:42,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1867741281 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1867741281 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1867741281 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1867741281 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In1867741281 |P1Thread1of1ForFork0_#t~ite31_Out1867741281|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1867741281|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1867741281, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1867741281, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1867741281, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1867741281} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1867741281|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1867741281, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1867741281, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1867741281, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1867741281} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:33:42,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:33:42,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:33:42,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1556292036 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1556292036 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out-1556292036| |ULTIMATE.start_main_#t~ite34_Out-1556292036|))) (or (and (or .cse0 .cse1) (= ~x~0_In-1556292036 |ULTIMATE.start_main_#t~ite34_Out-1556292036|) .cse2) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1556292036 |ULTIMATE.start_main_#t~ite34_Out-1556292036|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1556292036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556292036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1556292036, ~x~0=~x~0_In-1556292036} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1556292036, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1556292036|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556292036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1556292036, ~x~0=~x~0_In-1556292036, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1556292036|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:33:42,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-551025403 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-551025403 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-551025403|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-551025403| ~x$w_buff0_used~0_In-551025403) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-551025403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551025403} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-551025403, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-551025403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551025403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:33:42,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In363940123 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In363940123 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In363940123 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In363940123 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out363940123| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In363940123 |ULTIMATE.start_main_#t~ite37_Out363940123|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In363940123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In363940123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In363940123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In363940123} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In363940123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In363940123, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out363940123|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In363940123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In363940123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:33:42,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1997991371 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1997991371 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1997991371| ~x$r_buff0_thd0~0_In-1997991371) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1997991371| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1997991371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1997991371} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1997991371, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1997991371|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1997991371} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:33:42,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1071472756 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1071472756 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1071472756 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1071472756 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1071472756| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1071472756 |ULTIMATE.start_main_#t~ite39_Out1071472756|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1071472756, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1071472756, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1071472756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071472756} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1071472756, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1071472756|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1071472756, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1071472756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071472756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:33:42,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:33:43,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:33:43 BasicIcfg [2019-11-28 18:33:43,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:33:43,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:33:43,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:33:43,067 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:33:43,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:30" (3/4) ... [2019-11-28 18:33:43,070 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:33:43,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2563~0.base_24| 4) |v_#length_15|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0) (= 0 v_~x$w_buff0~0_579) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24| 1)) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24|) 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2563~0.base=|v_ULTIMATE.start_main_~#t2563~0.base_24|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2563~0.offset=|v_ULTIMATE.start_main_~#t2563~0.offset_18|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_25|, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2563~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2564~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2563~0.offset, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2564~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:33:43,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11|) |v_ULTIMATE.start_main_~#t2564~0.offset_9| 1)) |v_#memory_int_5|) (not (= |v_ULTIMATE.start_main_~#t2564~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t2564~0.offset_9|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2564~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2564~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_11|, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2564~0.base, ULTIMATE.start_main_~#t2564~0.offset] because there is no mapped edge [2019-11-28 18:33:43,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:33:43,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1832829477 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out1832829477| ~x$w_buff0~0_In1832829477) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In1832829477| |P0Thread1of1ForFork1_#t~ite8_Out1832829477|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1832829477 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1832829477 256))) (= 0 (mod ~x$w_buff0_used~0_In1832829477 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1832829477 256))))) (= |P0Thread1of1ForFork1_#t~ite8_Out1832829477| |P0Thread1of1ForFork1_#t~ite9_Out1832829477|) .cse0 (= |P0Thread1of1ForFork1_#t~ite8_Out1832829477| ~x$w_buff0~0_In1832829477)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1832829477, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832829477, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In1832829477|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832829477, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832829477, ~weak$$choice2~0=~weak$$choice2~0_In1832829477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832829477} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1832829477, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832829477, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1832829477|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out1832829477|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832829477, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832829477, ~weak$$choice2~0=~weak$$choice2~0_In1832829477, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832829477} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-11-28 18:33:43,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:33:43,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:33:43,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-418244067 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-418244067 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-418244067|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-418244067 |P1Thread1of1ForFork0_#t~ite28_Out-418244067|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-418244067, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418244067} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-418244067, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-418244067|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418244067} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:33:43,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1260259778 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1260259778 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1260259778 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1260259778 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1260259778|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1260259778 |P1Thread1of1ForFork0_#t~ite29_Out1260259778|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1260259778, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1260259778, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1260259778, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1260259778} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1260259778, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1260259778, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1260259778, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1260259778|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1260259778} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:33:43,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1884631742 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_Out-1884631742 ~x$r_buff0_thd2~0_In-1884631742)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1884631742 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= ~x$r_buff0_thd2~0_Out-1884631742 0)) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1884631742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1884631742} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1884631742|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1884631742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1884631742} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:33:43,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1867741281 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1867741281 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1867741281 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1867741281 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In1867741281 |P1Thread1of1ForFork0_#t~ite31_Out1867741281|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1867741281|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1867741281, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1867741281, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1867741281, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1867741281} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1867741281|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1867741281, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1867741281, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1867741281, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1867741281} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:33:43,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:33:43,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:33:43,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1556292036 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1556292036 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out-1556292036| |ULTIMATE.start_main_#t~ite34_Out-1556292036|))) (or (and (or .cse0 .cse1) (= ~x~0_In-1556292036 |ULTIMATE.start_main_#t~ite34_Out-1556292036|) .cse2) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1556292036 |ULTIMATE.start_main_#t~ite34_Out-1556292036|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1556292036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556292036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1556292036, ~x~0=~x~0_In-1556292036} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1556292036, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1556292036|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556292036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1556292036, ~x~0=~x~0_In-1556292036, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1556292036|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:33:43,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-551025403 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-551025403 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-551025403|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-551025403| ~x$w_buff0_used~0_In-551025403) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-551025403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551025403} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-551025403, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-551025403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551025403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:33:43,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In363940123 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In363940123 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In363940123 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In363940123 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out363940123| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In363940123 |ULTIMATE.start_main_#t~ite37_Out363940123|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In363940123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In363940123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In363940123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In363940123} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In363940123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In363940123, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out363940123|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In363940123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In363940123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:33:43,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1997991371 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1997991371 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1997991371| ~x$r_buff0_thd0~0_In-1997991371) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1997991371| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1997991371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1997991371} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1997991371, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1997991371|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1997991371} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:33:43,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1071472756 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1071472756 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1071472756 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1071472756 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1071472756| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1071472756 |ULTIMATE.start_main_#t~ite39_Out1071472756|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1071472756, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1071472756, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1071472756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071472756} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1071472756, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1071472756|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1071472756, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1071472756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071472756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:33:43,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:33:43,181 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:33:43,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:33:43,185 INFO L168 Benchmark]: Toolchain (without parser) took 14055.40 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 487.6 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -79.5 MB). Peak memory consumption was 408.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:43,188 INFO L168 Benchmark]: CDTParser took 0.89 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:33:43,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:43,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.20 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:43,194 INFO L168 Benchmark]: Boogie Preprocessor took 39.49 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:33:43,195 INFO L168 Benchmark]: RCFGBuilder took 739.96 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:43,196 INFO L168 Benchmark]: TraceAbstraction took 12311.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 350.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:43,196 INFO L168 Benchmark]: Witness Printer took 115.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:43,198 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.89 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 767.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.20 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.49 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 739.96 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12311.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 350.3 MB. Max. memory is 11.5 GB. * Witness Printer took 115.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2563, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2564, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1465 SDtfs, 1067 SDslu, 1963 SDs, 0 SdLazy, 1049 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9707occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 7759 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 28943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...