./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87d99481adc4b254c0581b7f015ea09b865ac0c3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:33,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:22:33,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:22:33,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:22:33,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:22:33,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:22:33,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:22:33,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:22:33,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:22:33,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:22:33,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:22:33,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:22:33,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:22:33,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:22:33,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:22:33,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:22:33,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:22:33,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:22:33,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:22:33,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:22:33,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:22:33,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:22:33,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:22:33,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:22:33,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:22:33,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:22:33,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:22:33,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:22:33,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:22:33,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:22:33,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:22:33,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:22:33,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:22:33,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:22:33,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:22:33,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:22:33,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:22:33,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:22:33,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:22:33,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:22:33,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:22:33,916 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:22:33,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:22:33,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:22:33,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:22:33,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:22:33,933 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:22:33,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:22:33,933 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:22:33,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:22:33,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:22:33,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:22:33,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:22:33,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:22:33,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:22:33,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:22:33,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:22:33,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:22:33,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:22:33,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:22:33,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:22:33,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:22:33,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:22:33,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:33,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:22:33,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:22:33,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:22:33,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:22:33,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:22:33,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:22:33,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:22:33,940 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 -> 87d99481adc4b254c0581b7f015ea09b865ac0c3 [2019-11-28 18:22:34,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:22:34,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:22:34,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:22:34,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:22:34,286 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:22:34,288 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt.i [2019-11-28 18:22:34,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ec608d7/ada8fb45ccb3401bbc650009bbc58856/FLAG8166f8d75 [2019-11-28 18:22:34,969 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:22:34,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi004_pso.opt.i [2019-11-28 18:22:34,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ec608d7/ada8fb45ccb3401bbc650009bbc58856/FLAG8166f8d75 [2019-11-28 18:22:35,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ec608d7/ada8fb45ccb3401bbc650009bbc58856 [2019-11-28 18:22:35,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:22:35,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:22:35,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:35,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:22:35,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:22:35,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75b40bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:35, skipping insertion in model container [2019-11-28 18:22:35,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:35" (1/1) ... [2019-11-28 18:22:35,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:22:35,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:22:35,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:35,970 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:22:36,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:36,151 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:22:36,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36 WrapperNode [2019-11-28 18:22:36,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:36,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:36,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:22:36,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:22:36,163 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:22:36" (1/1) ... [2019-11-28 18:22:36,193 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:22:36" (1/1) ... [2019-11-28 18:22:36,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:36,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:22:36,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:22:36,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:22:36,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... [2019-11-28 18:22:36,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:22:36,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:22:36,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:22:36,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:22:36,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:22:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:22:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:22:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:22:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:22:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:22:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:22:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:22:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:22:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:22:36,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:22:36,365 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:22:37,056 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:22:37,056 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:22:37,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:37 BoogieIcfgContainer [2019-11-28 18:22:37,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:22:37,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:22:37,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:22:37,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:22:37,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:22:35" (1/3) ... [2019-11-28 18:22:37,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a76848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:37, skipping insertion in model container [2019-11-28 18:22:37,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:36" (2/3) ... [2019-11-28 18:22:37,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a76848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:37, skipping insertion in model container [2019-11-28 18:22:37,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:37" (3/3) ... [2019-11-28 18:22:37,068 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.opt.i [2019-11-28 18:22:37,079 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:22:37,080 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:22:37,088 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:22:37,090 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:22:37,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,130 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,160 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,160 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,161 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:37,189 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:22:37,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:22:37,212 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:22:37,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:22:37,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:22:37,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:22:37,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:22:37,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:22:37,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:22:37,232 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-11-28 18:22:37,234 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-11-28 18:22:37,316 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-11-28 18:22:37,317 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:37,333 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:37,354 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-11-28 18:22:37,419 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-11-28 18:22:37,419 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:37,428 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:37,445 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:22:37,446 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:22:41,972 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:22:42,099 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:22:42,168 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-11-28 18:22:42,168 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-11-28 18:22:42,172 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-11-28 18:22:42,624 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-11-28 18:22:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-11-28 18:22:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:22:42,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:42,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:22:42,637 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:22:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:42,644 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-11-28 18:22:42,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:42,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61131096] [2019-11-28 18:22:42,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:43,073 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:22:43,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61131096] [2019-11-28 18:22:43,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:43,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:43,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013458649] [2019-11-28 18:22:43,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:43,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:43,117 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-11-28 18:22:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:43,457 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-11-28 18:22:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:43,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:22:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:43,560 INFO L225 Difference]: With dead ends: 6636 [2019-11-28 18:22:43,567 INFO L226 Difference]: Without dead ends: 6246 [2019-11-28 18:22:43,569 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:22:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-11-28 18:22:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-11-28 18:22:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-11-28 18:22:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-11-28 18:22:43,922 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-11-28 18:22:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:43,922 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-11-28 18:22:43,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-11-28 18:22:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:22:43,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:43,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:43,928 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:22:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:43,928 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-11-28 18:22:43,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:43,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603588313] [2019-11-28 18:22:43,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:44,008 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:22:44,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603588313] [2019-11-28 18:22:44,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:44,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:44,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917679335] [2019-11-28 18:22:44,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:44,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:44,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:44,012 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-11-28 18:22:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:44,383 INFO L93 Difference]: Finished difference Result 9424 states and 30254 transitions. [2019-11-28 18:22:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:44,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:22:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:44,466 INFO L225 Difference]: With dead ends: 9424 [2019-11-28 18:22:44,467 INFO L226 Difference]: Without dead ends: 9411 [2019-11-28 18:22:44,468 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:22:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-11-28 18:22:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 8307. [2019-11-28 18:22:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-11-28 18:22:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 27132 transitions. [2019-11-28 18:22:44,808 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 27132 transitions. Word has length 11 [2019-11-28 18:22:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:44,808 INFO L462 AbstractCegarLoop]: Abstraction has 8307 states and 27132 transitions. [2019-11-28 18:22:44,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 27132 transitions. [2019-11-28 18:22:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:44,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:44,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:44,817 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:22:44,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-11-28 18:22:44,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:44,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944857739] [2019-11-28 18:22:44,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:44,900 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:22:44,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944857739] [2019-11-28 18:22:44,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:44,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:44,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587902685] [2019-11-28 18:22:44,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:44,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:44,904 INFO L87 Difference]: Start difference. First operand 8307 states and 27132 transitions. Second operand 3 states. [2019-11-28 18:22:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:45,086 INFO L93 Difference]: Finished difference Result 11392 states and 37048 transitions. [2019-11-28 18:22:45,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:45,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:22:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:45,143 INFO L225 Difference]: With dead ends: 11392 [2019-11-28 18:22:45,144 INFO L226 Difference]: Without dead ends: 11392 [2019-11-28 18:22:45,144 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:22:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2019-11-28 18:22:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 10440. [2019-11-28 18:22:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10440 states. [2019-11-28 18:22:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10440 states to 10440 states and 34208 transitions. [2019-11-28 18:22:45,664 INFO L78 Accepts]: Start accepts. Automaton has 10440 states and 34208 transitions. Word has length 14 [2019-11-28 18:22:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:45,665 INFO L462 AbstractCegarLoop]: Abstraction has 10440 states and 34208 transitions. [2019-11-28 18:22:45,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10440 states and 34208 transitions. [2019-11-28 18:22:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:45,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:45,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:45,670 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:22:45,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:45,671 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-11-28 18:22:45,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:45,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350652289] [2019-11-28 18:22:45,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:45,733 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:22:45,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350652289] [2019-11-28 18:22:45,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:45,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:45,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350563893] [2019-11-28 18:22:45,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:45,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:45,735 INFO L87 Difference]: Start difference. First operand 10440 states and 34208 transitions. Second operand 4 states. [2019-11-28 18:22:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:45,995 INFO L93 Difference]: Finished difference Result 12648 states and 40515 transitions. [2019-11-28 18:22:45,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:45,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:46,050 INFO L225 Difference]: With dead ends: 12648 [2019-11-28 18:22:46,051 INFO L226 Difference]: Without dead ends: 12637 [2019-11-28 18:22:46,051 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:22:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2019-11-28 18:22:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 11272. [2019-11-28 18:22:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-11-28 18:22:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 36643 transitions. [2019-11-28 18:22:46,443 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 36643 transitions. Word has length 14 [2019-11-28 18:22:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:46,443 INFO L462 AbstractCegarLoop]: Abstraction has 11272 states and 36643 transitions. [2019-11-28 18:22:46,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 36643 transitions. [2019-11-28 18:22:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:46,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:46,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:46,447 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:22:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:46,448 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-11-28 18:22:46,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:46,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418487558] [2019-11-28 18:22:46,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:46,493 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:22:46,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418487558] [2019-11-28 18:22:46,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:46,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:46,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547910024] [2019-11-28 18:22:46,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:46,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:46,496 INFO L87 Difference]: Start difference. First operand 11272 states and 36643 transitions. Second operand 4 states. [2019-11-28 18:22:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:46,729 INFO L93 Difference]: Finished difference Result 13620 states and 43661 transitions. [2019-11-28 18:22:46,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:46,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:46,772 INFO L225 Difference]: With dead ends: 13620 [2019-11-28 18:22:46,772 INFO L226 Difference]: Without dead ends: 13607 [2019-11-28 18:22:46,772 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:22:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-11-28 18:22:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 11607. [2019-11-28 18:22:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-11-28 18:22:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 37707 transitions. [2019-11-28 18:22:47,141 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 37707 transitions. Word has length 14 [2019-11-28 18:22:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:47,141 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 37707 transitions. [2019-11-28 18:22:47,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 37707 transitions. [2019-11-28 18:22:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:47,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:47,147 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:22:47,147 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:22:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:47,148 INFO L82 PathProgramCache]: Analyzing trace with hash 833908596, now seen corresponding path program 1 times [2019-11-28 18:22:47,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:47,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62611972] [2019-11-28 18:22:47,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:47,421 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:22:47,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62611972] [2019-11-28 18:22:47,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:47,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:47,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799689853] [2019-11-28 18:22:47,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:47,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:47,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:47,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:47,424 INFO L87 Difference]: Start difference. First operand 11607 states and 37707 transitions. Second operand 3 states. [2019-11-28 18:22:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:47,492 INFO L93 Difference]: Finished difference Result 11464 states and 37241 transitions. [2019-11-28 18:22:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:47,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:47,524 INFO L225 Difference]: With dead ends: 11464 [2019-11-28 18:22:47,524 INFO L226 Difference]: Without dead ends: 11464 [2019-11-28 18:22:47,525 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:22:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11464 states. [2019-11-28 18:22:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11464 to 11464. [2019-11-28 18:22:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11464 states. [2019-11-28 18:22:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11464 states to 11464 states and 37241 transitions. [2019-11-28 18:22:47,890 INFO L78 Accepts]: Start accepts. Automaton has 11464 states and 37241 transitions. Word has length 16 [2019-11-28 18:22:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:47,891 INFO L462 AbstractCegarLoop]: Abstraction has 11464 states and 37241 transitions. [2019-11-28 18:22:47,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 11464 states and 37241 transitions. [2019-11-28 18:22:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:22:47,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:47,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:47,900 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:22:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash 89165451, now seen corresponding path program 1 times [2019-11-28 18:22:47,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:47,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663858852] [2019-11-28 18:22:47,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,004 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:22:48,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663858852] [2019-11-28 18:22:48,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:48,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497908133] [2019-11-28 18:22:48,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:48,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:48,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:48,007 INFO L87 Difference]: Start difference. First operand 11464 states and 37241 transitions. Second operand 3 states. [2019-11-28 18:22:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:48,075 INFO L93 Difference]: Finished difference Result 10861 states and 34721 transitions. [2019-11-28 18:22:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:48,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:22:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:48,100 INFO L225 Difference]: With dead ends: 10861 [2019-11-28 18:22:48,101 INFO L226 Difference]: Without dead ends: 10861 [2019-11-28 18:22:48,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-11-28 18:22:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10663. [2019-11-28 18:22:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10663 states. [2019-11-28 18:22:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10663 states to 10663 states and 34123 transitions. [2019-11-28 18:22:48,429 INFO L78 Accepts]: Start accepts. Automaton has 10663 states and 34123 transitions. Word has length 17 [2019-11-28 18:22:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,430 INFO L462 AbstractCegarLoop]: Abstraction has 10663 states and 34123 transitions. [2019-11-28 18:22:48,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 10663 states and 34123 transitions. [2019-11-28 18:22:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:22:48,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:48,440 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:22:48,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,441 INFO L82 PathProgramCache]: Analyzing trace with hash -832349724, now seen corresponding path program 1 times [2019-11-28 18:22:48,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491785082] [2019-11-28 18:22:48,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,517 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:22:48,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491785082] [2019-11-28 18:22:48,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:48,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706052461] [2019-11-28 18:22:48,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:48,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:48,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:48,520 INFO L87 Difference]: Start difference. First operand 10663 states and 34123 transitions. Second operand 4 states. [2019-11-28 18:22:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:48,566 INFO L93 Difference]: Finished difference Result 2208 states and 5787 transitions. [2019-11-28 18:22:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:48,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:22:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:48,570 INFO L225 Difference]: With dead ends: 2208 [2019-11-28 18:22:48,571 INFO L226 Difference]: Without dead ends: 1576 [2019-11-28 18:22:48,571 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:22:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-28 18:22:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-28 18:22:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-28 18:22:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3757 transitions. [2019-11-28 18:22:48,602 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3757 transitions. Word has length 18 [2019-11-28 18:22:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,602 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 3757 transitions. [2019-11-28 18:22:48,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3757 transitions. [2019-11-28 18:22:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:48,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,606 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:22:48,606 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:22:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-11-28 18:22:48,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511513508] [2019-11-28 18:22:48,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,669 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:22:48,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511513508] [2019-11-28 18:22:48,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:48,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105720526] [2019-11-28 18:22:48,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:48,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:48,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:48,672 INFO L87 Difference]: Start difference. First operand 1576 states and 3757 transitions. Second operand 5 states. [2019-11-28 18:22:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:48,874 INFO L93 Difference]: Finished difference Result 2187 states and 5165 transitions. [2019-11-28 18:22:48,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:48,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:22:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:48,878 INFO L225 Difference]: With dead ends: 2187 [2019-11-28 18:22:48,878 INFO L226 Difference]: Without dead ends: 2185 [2019-11-28 18:22:48,879 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:22:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2019-11-28 18:22:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1686. [2019-11-28 18:22:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-11-28 18:22:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 4016 transitions. [2019-11-28 18:22:48,912 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 4016 transitions. Word has length 26 [2019-11-28 18:22:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:48,913 INFO L462 AbstractCegarLoop]: Abstraction has 1686 states and 4016 transitions. [2019-11-28 18:22:48,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 4016 transitions. [2019-11-28 18:22:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:48,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:48,916 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:22:48,916 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:22:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash 427469221, now seen corresponding path program 1 times [2019-11-28 18:22:48,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:48,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131010314] [2019-11-28 18:22:48,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:48,985 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:22:48,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131010314] [2019-11-28 18:22:48,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:48,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:48,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422762127] [2019-11-28 18:22:48,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:48,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:48,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:48,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:48,987 INFO L87 Difference]: Start difference. First operand 1686 states and 4016 transitions. Second operand 5 states. [2019-11-28 18:22:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:49,197 INFO L93 Difference]: Finished difference Result 2156 states and 5083 transitions. [2019-11-28 18:22:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:49,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:49,201 INFO L225 Difference]: With dead ends: 2156 [2019-11-28 18:22:49,201 INFO L226 Difference]: Without dead ends: 2154 [2019-11-28 18:22:49,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:22:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-11-28 18:22:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1596. [2019-11-28 18:22:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-11-28 18:22:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 3807 transitions. [2019-11-28 18:22:49,231 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 3807 transitions. Word has length 27 [2019-11-28 18:22:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:49,232 INFO L462 AbstractCegarLoop]: Abstraction has 1596 states and 3807 transitions. [2019-11-28 18:22:49,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 3807 transitions. [2019-11-28 18:22:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:49,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:49,235 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:22:49,235 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:22:49,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash 225506980, now seen corresponding path program 1 times [2019-11-28 18:22:49,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:49,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552946168] [2019-11-28 18:22:49,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:49,312 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:22:49,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552946168] [2019-11-28 18:22:49,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:49,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:49,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461426005] [2019-11-28 18:22:49,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:49,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:49,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:49,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:49,315 INFO L87 Difference]: Start difference. First operand 1596 states and 3807 transitions. Second operand 5 states. [2019-11-28 18:22:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:49,369 INFO L93 Difference]: Finished difference Result 791 states and 1818 transitions. [2019-11-28 18:22:49,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:49,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:49,371 INFO L225 Difference]: With dead ends: 791 [2019-11-28 18:22:49,372 INFO L226 Difference]: Without dead ends: 716 [2019-11-28 18:22:49,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-28 18:22:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-11-28 18:22:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-28 18:22:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1637 transitions. [2019-11-28 18:22:49,384 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1637 transitions. Word has length 27 [2019-11-28 18:22:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:49,385 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1637 transitions. [2019-11-28 18:22:49,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1637 transitions. [2019-11-28 18:22:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:49,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:49,388 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:22:49,388 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:22:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash 394366268, now seen corresponding path program 1 times [2019-11-28 18:22:49,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:49,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806283926] [2019-11-28 18:22:49,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:49,498 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:22:49,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806283926] [2019-11-28 18:22:49,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:49,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:49,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979067793] [2019-11-28 18:22:49,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:49,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:49,500 INFO L87 Difference]: Start difference. First operand 716 states and 1637 transitions. Second operand 5 states. [2019-11-28 18:22:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:49,536 INFO L93 Difference]: Finished difference Result 1170 states and 2714 transitions. [2019-11-28 18:22:49,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:22:49,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 18:22:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:49,538 INFO L225 Difference]: With dead ends: 1170 [2019-11-28 18:22:49,538 INFO L226 Difference]: Without dead ends: 474 [2019-11-28 18:22:49,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-28 18:22:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-11-28 18:22:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-28 18:22:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1110 transitions. [2019-11-28 18:22:49,547 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1110 transitions. Word has length 42 [2019-11-28 18:22:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:49,548 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 1110 transitions. [2019-11-28 18:22:49,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1110 transitions. [2019-11-28 18:22:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:49,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:49,550 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:22:49,550 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:22:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:49,551 INFO L82 PathProgramCache]: Analyzing trace with hash 380081836, now seen corresponding path program 2 times [2019-11-28 18:22:49,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:49,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28450296] [2019-11-28 18:22:49,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:49,670 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:22:49,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28450296] [2019-11-28 18:22:49,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:49,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:22:49,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470393285] [2019-11-28 18:22:49,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:22:49,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:49,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:22:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:49,673 INFO L87 Difference]: Start difference. First operand 474 states and 1110 transitions. Second operand 7 states. [2019-11-28 18:22:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:49,877 INFO L93 Difference]: Finished difference Result 866 states and 1972 transitions. [2019-11-28 18:22:49,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:22:49,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:22:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:49,881 INFO L225 Difference]: With dead ends: 866 [2019-11-28 18:22:49,881 INFO L226 Difference]: Without dead ends: 580 [2019-11-28 18:22:49,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-28 18:22:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 514. [2019-11-28 18:22:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-11-28 18:22:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1172 transitions. [2019-11-28 18:22:49,893 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1172 transitions. Word has length 42 [2019-11-28 18:22:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:49,893 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1172 transitions. [2019-11-28 18:22:49,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:22:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1172 transitions. [2019-11-28 18:22:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:49,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:49,895 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:22:49,896 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:22:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:49,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 3 times [2019-11-28 18:22:49,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:49,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437259341] [2019-11-28 18:22:49,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:50,071 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:50,071 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:50,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1655~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1655~0.base_19|) |v_ULTIMATE.start_main_~#t1655~0.offset_17| 0)) |v_#memory_int_11|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= 0 |v_ULTIMATE.start_main_~#t1655~0.offset_17|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1655~0.base_19|) 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1655~0.base_19| 4)) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1655~0.base_19|) (= v_~y$w_buff1~0_385 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1655~0.base_19| 1) |v_#valid_38|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ULTIMATE.start_main_~#t1656~0.base=|v_ULTIMATE.start_main_~#t1656~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1655~0.base=|v_ULTIMATE.start_main_~#t1655~0.base_19|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ULTIMATE.start_main_~#t1656~0.offset=|v_ULTIMATE.start_main_~#t1656~0.offset_17|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1655~0.offset=|v_ULTIMATE.start_main_~#t1655~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1656~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1655~0.base, ~y$w_buff1~0, ULTIMATE.start_main_~#t1656~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1655~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:22:50,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1656~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1656~0.base_9|)) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1656~0.base_9| 1) |v_#valid_19|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1656~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1656~0.offset_8| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1656~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1656~0.base_9|) |v_ULTIMATE.start_main_~#t1656~0.offset_8| 1))) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1656~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1656~0.offset=|v_ULTIMATE.start_main_~#t1656~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1656~0.base=|v_ULTIMATE.start_main_~#t1656~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1656~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1656~0.base] because there is no mapped edge [2019-11-28 18:22:50,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:50,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-85808361 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-85808361 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-85808361| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-85808361| ~y$w_buff0_used~0_In-85808361)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-85808361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85808361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-85808361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85808361, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-85808361|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:50,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-296557712 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-296557712 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-296557712 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-296557712 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-296557712|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-296557712| ~y$w_buff1_used~0_In-296557712) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-296557712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-296557712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-296557712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-296557712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-296557712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-296557712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-296557712, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-296557712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-296557712} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:50,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1706045460 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1706045460 256) 0)) (.cse0 (= ~y$r_buff0_thd2~0_In-1706045460 ~y$r_buff0_thd2~0_Out-1706045460))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~y$r_buff0_thd2~0_Out-1706045460)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1706045460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1706045460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1706045460, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1706045460|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1706045460} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:50,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1652321916 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite18_Out-1652321916| |P0Thread1of1ForFork1_#t~ite17_Out-1652321916|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1652321916 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-1652321916 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1652321916 256))) (= (mod ~y$w_buff0_used~0_In-1652321916 256) 0))) (= |P0Thread1of1ForFork1_#t~ite17_Out-1652321916| ~y$w_buff1_used~0_In-1652321916)) (and (= |P0Thread1of1ForFork1_#t~ite18_Out-1652321916| ~y$w_buff1_used~0_In-1652321916) (= |P0Thread1of1ForFork1_#t~ite17_In-1652321916| |P0Thread1of1ForFork1_#t~ite17_Out-1652321916|) (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1652321916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1652321916, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1652321916, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-1652321916|, ~weak$$choice2~0=~weak$$choice2~0_In-1652321916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1652321916} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1652321916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1652321916, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1652321916, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-1652321916|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-1652321916|, ~weak$$choice2~0=~weak$$choice2~0_In-1652321916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1652321916} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:22:50,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:22:50,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:22:50,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2065170236 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2065170236 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2065170236 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2065170236 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out2065170236|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In2065170236 |P1Thread1of1ForFork0_#t~ite31_Out2065170236|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2065170236, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065170236, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2065170236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065170236} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2065170236, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065170236, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2065170236|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2065170236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065170236} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:50,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:50,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:22:50,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1486475625 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1486475625 256) 0))) (or (and (= ~y~0_In1486475625 |ULTIMATE.start_main_#t~ite34_Out1486475625|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite34_Out1486475625| ~y$w_buff1~0_In1486475625) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1486475625, ~y~0=~y~0_In1486475625, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1486475625, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1486475625} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1486475625, ~y~0=~y~0_In1486475625, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1486475625, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1486475625|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1486475625} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:50,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:50,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1063001999 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1063001999 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1063001999| ~y$w_buff0_used~0_In-1063001999)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1063001999| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1063001999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1063001999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1063001999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1063001999, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1063001999|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:50,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-510425497 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-510425497 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-510425497 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-510425497 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-510425497 |ULTIMATE.start_main_#t~ite37_Out-510425497|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-510425497| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-510425497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-510425497, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-510425497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-510425497} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-510425497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-510425497, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-510425497|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-510425497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-510425497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:50,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1063049362 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1063049362 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1063049362| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1063049362| ~y$r_buff0_thd0~0_In1063049362)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1063049362, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1063049362} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1063049362, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1063049362, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1063049362|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:50,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-475767028 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-475767028 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-475767028 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-475767028 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-475767028|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-475767028 |ULTIMATE.start_main_#t~ite39_Out-475767028|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-475767028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-475767028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-475767028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-475767028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-475767028, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-475767028|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-475767028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-475767028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-475767028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:50,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:50,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:50 BasicIcfg [2019-11-28 18:22:50,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:50,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:50,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:50,272 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:50,275 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:37" (3/4) ... [2019-11-28 18:22:50,283 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:50,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1655~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1655~0.base_19|) |v_ULTIMATE.start_main_~#t1655~0.offset_17| 0)) |v_#memory_int_11|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= 0 |v_ULTIMATE.start_main_~#t1655~0.offset_17|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1655~0.base_19|) 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1655~0.base_19| 4)) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1655~0.base_19|) (= v_~y$w_buff1~0_385 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1655~0.base_19| 1) |v_#valid_38|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ULTIMATE.start_main_~#t1656~0.base=|v_ULTIMATE.start_main_~#t1656~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1655~0.base=|v_ULTIMATE.start_main_~#t1655~0.base_19|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ULTIMATE.start_main_~#t1656~0.offset=|v_ULTIMATE.start_main_~#t1656~0.offset_17|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1655~0.offset=|v_ULTIMATE.start_main_~#t1655~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1656~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1655~0.base, ~y$w_buff1~0, ULTIMATE.start_main_~#t1656~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1655~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:22:50,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1656~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1656~0.base_9|)) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1656~0.base_9| 1) |v_#valid_19|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1656~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1656~0.offset_8| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1656~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1656~0.base_9|) |v_ULTIMATE.start_main_~#t1656~0.offset_8| 1))) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1656~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1656~0.offset=|v_ULTIMATE.start_main_~#t1656~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1656~0.base=|v_ULTIMATE.start_main_~#t1656~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1656~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1656~0.base] because there is no mapped edge [2019-11-28 18:22:50,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:50,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-85808361 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-85808361 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-85808361| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-85808361| ~y$w_buff0_used~0_In-85808361)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-85808361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85808361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-85808361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-85808361, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-85808361|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:50,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-296557712 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-296557712 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-296557712 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-296557712 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-296557712|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-296557712| ~y$w_buff1_used~0_In-296557712) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-296557712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-296557712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-296557712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-296557712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-296557712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-296557712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-296557712, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-296557712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-296557712} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:50,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1706045460 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1706045460 256) 0)) (.cse0 (= ~y$r_buff0_thd2~0_In-1706045460 ~y$r_buff0_thd2~0_Out-1706045460))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~y$r_buff0_thd2~0_Out-1706045460)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1706045460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1706045460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1706045460, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1706045460|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1706045460} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:50,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1652321916 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite18_Out-1652321916| |P0Thread1of1ForFork1_#t~ite17_Out-1652321916|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1652321916 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-1652321916 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1652321916 256))) (= (mod ~y$w_buff0_used~0_In-1652321916 256) 0))) (= |P0Thread1of1ForFork1_#t~ite17_Out-1652321916| ~y$w_buff1_used~0_In-1652321916)) (and (= |P0Thread1of1ForFork1_#t~ite18_Out-1652321916| ~y$w_buff1_used~0_In-1652321916) (= |P0Thread1of1ForFork1_#t~ite17_In-1652321916| |P0Thread1of1ForFork1_#t~ite17_Out-1652321916|) (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1652321916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1652321916, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1652321916, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-1652321916|, ~weak$$choice2~0=~weak$$choice2~0_In-1652321916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1652321916} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1652321916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1652321916, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1652321916, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-1652321916|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-1652321916|, ~weak$$choice2~0=~weak$$choice2~0_In-1652321916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1652321916} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:22:50,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:22:50,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:22:50,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2065170236 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2065170236 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2065170236 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2065170236 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out2065170236|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In2065170236 |P1Thread1of1ForFork0_#t~ite31_Out2065170236|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2065170236, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065170236, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2065170236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065170236} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2065170236, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065170236, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2065170236|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2065170236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065170236} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:50,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:50,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:22:50,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1486475625 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1486475625 256) 0))) (or (and (= ~y~0_In1486475625 |ULTIMATE.start_main_#t~ite34_Out1486475625|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite34_Out1486475625| ~y$w_buff1~0_In1486475625) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1486475625, ~y~0=~y~0_In1486475625, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1486475625, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1486475625} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1486475625, ~y~0=~y~0_In1486475625, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1486475625, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1486475625|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1486475625} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:50,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:50,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1063001999 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1063001999 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1063001999| ~y$w_buff0_used~0_In-1063001999)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1063001999| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1063001999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1063001999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1063001999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1063001999, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1063001999|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:50,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-510425497 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-510425497 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-510425497 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-510425497 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-510425497 |ULTIMATE.start_main_#t~ite37_Out-510425497|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-510425497| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-510425497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-510425497, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-510425497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-510425497} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-510425497, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-510425497, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-510425497|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-510425497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-510425497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:50,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1063049362 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1063049362 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1063049362| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1063049362| ~y$r_buff0_thd0~0_In1063049362)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1063049362, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1063049362} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1063049362, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1063049362, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1063049362|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:50,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-475767028 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-475767028 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-475767028 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-475767028 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-475767028|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-475767028 |ULTIMATE.start_main_#t~ite39_Out-475767028|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-475767028, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-475767028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-475767028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-475767028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-475767028, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-475767028|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-475767028, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-475767028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-475767028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:50,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:50,385 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:50,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:50,387 INFO L168 Benchmark]: Toolchain (without parser) took 15095.11 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 495.5 MB). Free memory was 960.4 MB in the beginning and 1.4 GB in the end (delta: -417.4 MB). Peak memory consumption was 78.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:50,388 INFO L168 Benchmark]: CDTParser took 0.58 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:22:50,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:50,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.59 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:22:50,395 INFO L168 Benchmark]: Boogie Preprocessor took 44.38 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:50,399 INFO L168 Benchmark]: RCFGBuilder took 771.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:50,400 INFO L168 Benchmark]: TraceAbstraction took 13212.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -351.1 MB). Peak memory consumption was 656.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:50,400 INFO L168 Benchmark]: Witness Printer took 113.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:50,405 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.58 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 859.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.38 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 771.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13212.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -351.1 MB). Peak memory consumption was 656.0 MB. Max. memory is 11.5 GB. * Witness Printer took 113.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1655, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1656, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1329 SDtfs, 1384 SDslu, 2131 SDs, 0 SdLazy, 861 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11607occurred 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.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 6742 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 24802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...