./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4a72557a25d3ff27b5a7864de9df538301d131d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:11:22,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:22,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:22,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:22,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:22,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:22,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:22,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:22,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:22,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:22,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:22,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:22,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:22,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:22,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:22,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:22,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:22,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:22,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:22,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:22,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:22,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:22,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:22,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:22,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:22,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:22,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:22,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:22,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:22,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:22,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:22,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:22,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:22,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:22,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:22,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:22,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:22,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:22,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:22,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:22,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:22,986 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:11:23,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:23,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:23,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:23,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:23,023 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:23,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:23,024 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:23,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:23,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:23,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:23,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:23,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:23,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:23,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:23,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:23,028 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:23,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:23,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:23,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:23,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:23,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:23,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:23,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:23,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:23,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:23,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:23,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:23,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:23,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:23,032 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 -> e4a72557a25d3ff27b5a7864de9df538301d131d [2019-11-28 18:11:23,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:23,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:23,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:23,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:23,449 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:23,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-11-28 18:11:23,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c483baa/167c1f330c594d948f92e91bec78a0ba/FLAG54b339bea [2019-11-28 18:11:24,073 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:24,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031_power.opt.i [2019-11-28 18:11:24,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c483baa/167c1f330c594d948f92e91bec78a0ba/FLAG54b339bea [2019-11-28 18:11:24,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c483baa/167c1f330c594d948f92e91bec78a0ba [2019-11-28 18:11:24,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:24,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:24,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:24,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:24,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:24,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:24" (1/1) ... [2019-11-28 18:11:24,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@323dcc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:24, skipping insertion in model container [2019-11-28 18:11:24,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:24" (1/1) ... [2019-11-28 18:11:24,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:24,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:24,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:24,921 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:24,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:25,052 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:25,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25 WrapperNode [2019-11-28 18:11:25,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:25,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:25,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:25,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:25,064 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:11:25" (1/1) ... [2019-11-28 18:11:25,082 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:11:25" (1/1) ... [2019-11-28 18:11:25,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:25,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:25,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:25,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:25,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (1/1) ... [2019-11-28 18:11:25,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (1/1) ... [2019-11-28 18:11:25,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (1/1) ... [2019-11-28 18:11:25,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (1/1) ... [2019-11-28 18:11:25,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (1/1) ... [2019-11-28 18:11:25,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (1/1) ... [2019-11-28 18:11:25,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (1/1) ... [2019-11-28 18:11:25,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:25,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:25,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:25,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:25,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (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:11:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:25,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:25,226 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:25,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:25,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:25,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:25,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:25,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:25,230 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:11:25,943 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:25,943 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:25,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:25 BoogieIcfgContainer [2019-11-28 18:11:25,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:25,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:25,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:25,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:25,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:24" (1/3) ... [2019-11-28 18:11:25,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580b99c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:25, skipping insertion in model container [2019-11-28 18:11:25,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:25" (2/3) ... [2019-11-28 18:11:25,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580b99c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:25, skipping insertion in model container [2019-11-28 18:11:25,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:25" (3/3) ... [2019-11-28 18:11:25,959 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-11-28 18:11:25,970 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:25,971 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:11:25,982 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:11:25,983 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:11:26,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,040 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,041 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,085 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,085 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,086 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:26,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:11:26,144 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:11:26,144 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:11:26,145 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:11:26,145 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:11:26,145 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:11:26,145 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:11:26,145 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:11:26,145 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:11:26,162 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-11-28 18:11:26,164 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-11-28 18:11:26,247 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-11-28 18:11:26,248 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:26,268 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:11:26,290 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-11-28 18:11:26,372 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-11-28 18:11:26,372 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:26,378 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:11:26,393 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:11:26,395 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:11:30,819 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 18:11:31,118 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-11-28 18:11:31,248 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 18:11:31,414 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 18:11:31,602 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:11:31,634 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-11-28 18:11:31,635 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-11-28 18:11:31,639 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-11-28 18:11:32,054 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-11-28 18:11:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-11-28 18:11:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:11:32,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:32,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:11:32,067 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:32,077 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-11-28 18:11:32,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:32,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800828845] [2019-11-28 18:11:32,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:32,417 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:11:32,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800828845] [2019-11-28 18:11:32,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:32,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:32,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802213201] [2019-11-28 18:11:32,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:32,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:32,457 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-11-28 18:11:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:32,730 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-11-28 18:11:32,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:32,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:11:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:32,848 INFO L225 Difference]: With dead ends: 6414 [2019-11-28 18:11:32,850 INFO L226 Difference]: Without dead ends: 6042 [2019-11-28 18:11:32,853 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:11:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-11-28 18:11:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-11-28 18:11:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-11-28 18:11:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-11-28 18:11:33,254 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-11-28 18:11:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:33,255 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-11-28 18:11:33,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-11-28 18:11:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:11:33,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:33,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:33,262 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:33,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-11-28 18:11:33,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:33,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827223088] [2019-11-28 18:11:33,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:33,380 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:11:33,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827223088] [2019-11-28 18:11:33,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:33,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:33,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695434997] [2019-11-28 18:11:33,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:33,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:33,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:33,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:33,383 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 4 states. [2019-11-28 18:11:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:33,726 INFO L93 Difference]: Finished difference Result 9128 states and 29363 transitions. [2019-11-28 18:11:33,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:33,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:11:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:33,820 INFO L225 Difference]: With dead ends: 9128 [2019-11-28 18:11:33,821 INFO L226 Difference]: Without dead ends: 9113 [2019-11-28 18:11:33,822 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:11:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-11-28 18:11:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8369. [2019-11-28 18:11:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-11-28 18:11:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 27318 transitions. [2019-11-28 18:11:34,198 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 27318 transitions. Word has length 11 [2019-11-28 18:11:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:34,199 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 27318 transitions. [2019-11-28 18:11:34,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 27318 transitions. [2019-11-28 18:11:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:34,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:34,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:34,209 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-11-28 18:11:34,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:34,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739945322] [2019-11-28 18:11:34,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:34,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739945322] [2019-11-28 18:11:34,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:34,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:34,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111213713] [2019-11-28 18:11:34,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:34,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:34,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:34,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:34,328 INFO L87 Difference]: Start difference. First operand 8369 states and 27318 transitions. Second operand 3 states. [2019-11-28 18:11:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:34,502 INFO L93 Difference]: Finished difference Result 11252 states and 36788 transitions. [2019-11-28 18:11:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:34,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:11:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:34,686 INFO L225 Difference]: With dead ends: 11252 [2019-11-28 18:11:34,686 INFO L226 Difference]: Without dead ends: 11252 [2019-11-28 18:11:34,687 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:11:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states. [2019-11-28 18:11:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 9819. [2019-11-28 18:11:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-11-28 18:11:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32327 transitions. [2019-11-28 18:11:35,083 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32327 transitions. Word has length 14 [2019-11-28 18:11:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:35,085 INFO L462 AbstractCegarLoop]: Abstraction has 9819 states and 32327 transitions. [2019-11-28 18:11:35,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32327 transitions. [2019-11-28 18:11:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:35,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:35,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:35,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-11-28 18:11:35,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:35,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319907435] [2019-11-28 18:11:35,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:35,217 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:11:35,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319907435] [2019-11-28 18:11:35,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:35,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:35,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560758487] [2019-11-28 18:11:35,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:35,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:35,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:35,222 INFO L87 Difference]: Start difference. First operand 9819 states and 32327 transitions. Second operand 4 states. [2019-11-28 18:11:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:35,441 INFO L93 Difference]: Finished difference Result 11915 states and 38297 transitions. [2019-11-28 18:11:35,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:35,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:35,488 INFO L225 Difference]: With dead ends: 11915 [2019-11-28 18:11:35,488 INFO L226 Difference]: Without dead ends: 11904 [2019-11-28 18:11:35,488 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:11:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2019-11-28 18:11:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10744. [2019-11-28 18:11:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-11-28 18:11:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 35020 transitions. [2019-11-28 18:11:35,853 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 35020 transitions. Word has length 14 [2019-11-28 18:11:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:35,853 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 35020 transitions. [2019-11-28 18:11:35,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 35020 transitions. [2019-11-28 18:11:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:35,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:35,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:35,857 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-11-28 18:11:35,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:35,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938758115] [2019-11-28 18:11:35,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:35,898 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:11:35,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938758115] [2019-11-28 18:11:35,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:35,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:35,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835168156] [2019-11-28 18:11:35,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:35,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:35,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:35,901 INFO L87 Difference]: Start difference. First operand 10744 states and 35020 transitions. Second operand 4 states. [2019-11-28 18:11:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:36,099 INFO L93 Difference]: Finished difference Result 12870 states and 41385 transitions. [2019-11-28 18:11:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:36,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:36,146 INFO L225 Difference]: With dead ends: 12870 [2019-11-28 18:11:36,146 INFO L226 Difference]: Without dead ends: 12857 [2019-11-28 18:11:36,147 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:11:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12857 states. [2019-11-28 18:11:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12857 to 10870. [2019-11-28 18:11:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10870 states. [2019-11-28 18:11:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 35539 transitions. [2019-11-28 18:11:36,655 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 35539 transitions. Word has length 14 [2019-11-28 18:11:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:36,655 INFO L462 AbstractCegarLoop]: Abstraction has 10870 states and 35539 transitions. [2019-11-28 18:11:36,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 35539 transitions. [2019-11-28 18:11:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:11:36,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:36,661 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:11:36,661 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash -133127032, now seen corresponding path program 1 times [2019-11-28 18:11:36,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:36,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319680167] [2019-11-28 18:11:36,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:36,735 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:11:36,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319680167] [2019-11-28 18:11:36,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:36,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:36,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124390659] [2019-11-28 18:11:36,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:36,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:36,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:36,738 INFO L87 Difference]: Start difference. First operand 10870 states and 35539 transitions. Second operand 3 states. [2019-11-28 18:11:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:36,798 INFO L93 Difference]: Finished difference Result 10914 states and 35611 transitions. [2019-11-28 18:11:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:36,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:11:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:36,830 INFO L225 Difference]: With dead ends: 10914 [2019-11-28 18:11:36,831 INFO L226 Difference]: Without dead ends: 10914 [2019-11-28 18:11:36,831 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:11:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-11-28 18:11:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10867. [2019-11-28 18:11:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10867 states. [2019-11-28 18:11:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 35530 transitions. [2019-11-28 18:11:37,156 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 35530 transitions. Word has length 16 [2019-11-28 18:11:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:37,157 INFO L462 AbstractCegarLoop]: Abstraction has 10867 states and 35530 transitions. [2019-11-28 18:11:37,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 35530 transitions. [2019-11-28 18:11:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:11:37,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:37,164 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:11:37,164 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1519842378, now seen corresponding path program 1 times [2019-11-28 18:11:37,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:37,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124802118] [2019-11-28 18:11:37,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:37,198 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:11:37,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124802118] [2019-11-28 18:11:37,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:37,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:37,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168723605] [2019-11-28 18:11:37,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:37,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:37,200 INFO L87 Difference]: Start difference. First operand 10867 states and 35530 transitions. Second operand 3 states. [2019-11-28 18:11:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:37,215 INFO L93 Difference]: Finished difference Result 1664 states and 4070 transitions. [2019-11-28 18:11:37,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:37,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:11:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:37,219 INFO L225 Difference]: With dead ends: 1664 [2019-11-28 18:11:37,220 INFO L226 Difference]: Without dead ends: 1664 [2019-11-28 18:11:37,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-11-28 18:11:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-11-28 18:11:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-11-28 18:11:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-11-28 18:11:37,252 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 17 [2019-11-28 18:11:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:37,253 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-11-28 18:11:37,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-11-28 18:11:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:37,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:37,257 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:11:37,257 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:37,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-11-28 18:11:37,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:37,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047627790] [2019-11-28 18:11:37,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:37,328 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:11:37,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047627790] [2019-11-28 18:11:37,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:37,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:37,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956914392] [2019-11-28 18:11:37,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:37,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:37,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:37,331 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 5 states. [2019-11-28 18:11:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:37,532 INFO L93 Difference]: Finished difference Result 2291 states and 5479 transitions. [2019-11-28 18:11:37,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:37,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:11:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:37,536 INFO L225 Difference]: With dead ends: 2291 [2019-11-28 18:11:37,536 INFO L226 Difference]: Without dead ends: 2289 [2019-11-28 18:11:37,536 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:11:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-11-28 18:11:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1836. [2019-11-28 18:11:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-11-28 18:11:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4456 transitions. [2019-11-28 18:11:37,574 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4456 transitions. Word has length 26 [2019-11-28 18:11:37,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:37,575 INFO L462 AbstractCegarLoop]: Abstraction has 1836 states and 4456 transitions. [2019-11-28 18:11:37,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4456 transitions. [2019-11-28 18:11:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:37,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:37,579 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:11:37,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2141135354, now seen corresponding path program 1 times [2019-11-28 18:11:37,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:37,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344584324] [2019-11-28 18:11:37,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:37,658 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:11:37,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344584324] [2019-11-28 18:11:37,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:37,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:11:37,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935724131] [2019-11-28 18:11:37,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:37,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:37,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:37,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:37,661 INFO L87 Difference]: Start difference. First operand 1836 states and 4456 transitions. Second operand 5 states. [2019-11-28 18:11:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:38,071 INFO L93 Difference]: Finished difference Result 2650 states and 6314 transitions. [2019-11-28 18:11:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:11:38,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:11:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:38,076 INFO L225 Difference]: With dead ends: 2650 [2019-11-28 18:11:38,076 INFO L226 Difference]: Without dead ends: 2650 [2019-11-28 18:11:38,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-11-28 18:11:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2252. [2019-11-28 18:11:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2019-11-28 18:11:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 5409 transitions. [2019-11-28 18:11:38,120 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 5409 transitions. Word has length 26 [2019-11-28 18:11:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:38,121 INFO L462 AbstractCegarLoop]: Abstraction has 2252 states and 5409 transitions. [2019-11-28 18:11:38,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 5409 transitions. [2019-11-28 18:11:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:38,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:38,126 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:11:38,127 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:38,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:38,127 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-11-28 18:11:38,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:38,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868610102] [2019-11-28 18:11:38,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:38,200 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:11:38,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868610102] [2019-11-28 18:11:38,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:38,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:38,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378371596] [2019-11-28 18:11:38,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:38,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:38,203 INFO L87 Difference]: Start difference. First operand 2252 states and 5409 transitions. Second operand 5 states. [2019-11-28 18:11:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:38,480 INFO L93 Difference]: Finished difference Result 2774 states and 6566 transitions. [2019-11-28 18:11:38,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:38,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:11:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:38,487 INFO L225 Difference]: With dead ends: 2774 [2019-11-28 18:11:38,487 INFO L226 Difference]: Without dead ends: 2772 [2019-11-28 18:11:38,488 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:11:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-11-28 18:11:38,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2152. [2019-11-28 18:11:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-11-28 18:11:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 5178 transitions. [2019-11-28 18:11:38,548 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 5178 transitions. Word has length 27 [2019-11-28 18:11:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:38,549 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 5178 transitions. [2019-11-28 18:11:38,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 5178 transitions. [2019-11-28 18:11:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:38,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:38,556 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:11:38,556 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1661250727, now seen corresponding path program 1 times [2019-11-28 18:11:38,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:38,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403651795] [2019-11-28 18:11:38,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:38,613 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:11:38,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403651795] [2019-11-28 18:11:38,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:38,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:38,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171718400] [2019-11-28 18:11:38,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:38,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:38,617 INFO L87 Difference]: Start difference. First operand 2152 states and 5178 transitions. Second operand 4 states. [2019-11-28 18:11:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:38,644 INFO L93 Difference]: Finished difference Result 1048 states and 2349 transitions. [2019-11-28 18:11:38,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:38,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:11:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:38,648 INFO L225 Difference]: With dead ends: 1048 [2019-11-28 18:11:38,648 INFO L226 Difference]: Without dead ends: 1048 [2019-11-28 18:11:38,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-28 18:11:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 945. [2019-11-28 18:11:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-28 18:11:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2144 transitions. [2019-11-28 18:11:38,672 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2144 transitions. Word has length 27 [2019-11-28 18:11:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:38,673 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 2144 transitions. [2019-11-28 18:11:38,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2144 transitions. [2019-11-28 18:11:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:11:38,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:38,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:38,677 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-11-28 18:11:38,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:38,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209582832] [2019-11-28 18:11:38,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:38,772 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:11:38,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209582832] [2019-11-28 18:11:38,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:38,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:38,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986700253] [2019-11-28 18:11:38,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:11:38,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:11:38,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:38,777 INFO L87 Difference]: Start difference. First operand 945 states and 2144 transitions. Second operand 6 states. [2019-11-28 18:11:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:39,224 INFO L93 Difference]: Finished difference Result 1244 states and 2733 transitions. [2019-11-28 18:11:39,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:11:39,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-28 18:11:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:39,227 INFO L225 Difference]: With dead ends: 1244 [2019-11-28 18:11:39,227 INFO L226 Difference]: Without dead ends: 1244 [2019-11-28 18:11:39,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:11:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-11-28 18:11:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 980. [2019-11-28 18:11:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-11-28 18:11:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2214 transitions. [2019-11-28 18:11:39,251 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2214 transitions. Word has length 41 [2019-11-28 18:11:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:39,254 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 2214 transitions. [2019-11-28 18:11:39,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:11:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2214 transitions. [2019-11-28 18:11:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:11:39,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:39,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:39,259 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash 372989159, now seen corresponding path program 2 times [2019-11-28 18:11:39,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:39,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827806563] [2019-11-28 18:11:39,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:39,450 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:11:39,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827806563] [2019-11-28 18:11:39,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:39,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:39,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155800517] [2019-11-28 18:11:39,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:39,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:39,460 INFO L87 Difference]: Start difference. First operand 980 states and 2214 transitions. Second operand 3 states. [2019-11-28 18:11:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:39,476 INFO L93 Difference]: Finished difference Result 978 states and 2209 transitions. [2019-11-28 18:11:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:39,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 18:11:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:39,479 INFO L225 Difference]: With dead ends: 978 [2019-11-28 18:11:39,479 INFO L226 Difference]: Without dead ends: 978 [2019-11-28 18:11:39,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-28 18:11:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 907. [2019-11-28 18:11:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-28 18:11:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2072 transitions. [2019-11-28 18:11:39,505 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2072 transitions. Word has length 41 [2019-11-28 18:11:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:39,506 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 2072 transitions. [2019-11-28 18:11:39,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2072 transitions. [2019-11-28 18:11:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:39,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:39,510 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:11:39,510 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:39,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1722201146, now seen corresponding path program 1 times [2019-11-28 18:11:39,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:39,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133376529] [2019-11-28 18:11:39,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:39,659 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:11:39,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133376529] [2019-11-28 18:11:39,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:39,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:39,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048429496] [2019-11-28 18:11:39,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:39,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:39,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:39,663 INFO L87 Difference]: Start difference. First operand 907 states and 2072 transitions. Second operand 4 states. [2019-11-28 18:11:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:39,687 INFO L93 Difference]: Finished difference Result 1563 states and 3600 transitions. [2019-11-28 18:11:39,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:39,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-28 18:11:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:39,691 INFO L225 Difference]: With dead ends: 1563 [2019-11-28 18:11:39,691 INFO L226 Difference]: Without dead ends: 684 [2019-11-28 18:11:39,693 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:11:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-11-28 18:11:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2019-11-28 18:11:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-11-28 18:11:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1576 transitions. [2019-11-28 18:11:39,711 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1576 transitions. Word has length 42 [2019-11-28 18:11:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:39,711 INFO L462 AbstractCegarLoop]: Abstraction has 684 states and 1576 transitions. [2019-11-28 18:11:39,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1576 transitions. [2019-11-28 18:11:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:39,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:39,715 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:11:39,715 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash -146556572, now seen corresponding path program 2 times [2019-11-28 18:11:39,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:39,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826152534] [2019-11-28 18:11:39,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:39,848 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:11:39,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826152534] [2019-11-28 18:11:39,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:39,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:39,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49673146] [2019-11-28 18:11:39,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:11:39,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:11:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:39,851 INFO L87 Difference]: Start difference. First operand 684 states and 1576 transitions. Second operand 7 states. [2019-11-28 18:11:39,972 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-28 18:11:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:40,118 INFO L93 Difference]: Finished difference Result 1118 states and 2505 transitions. [2019-11-28 18:11:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:11:40,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:11:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:40,120 INFO L225 Difference]: With dead ends: 1118 [2019-11-28 18:11:40,120 INFO L226 Difference]: Without dead ends: 737 [2019-11-28 18:11:40,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:11:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-11-28 18:11:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 695. [2019-11-28 18:11:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-11-28 18:11:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-11-28 18:11:40,135 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 42 [2019-11-28 18:11:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:40,135 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-11-28 18:11:40,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:11:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-11-28 18:11:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:40,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:40,139 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:11:40,139 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:40,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:40,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 3 times [2019-11-28 18:11:40,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:40,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757105576] [2019-11-28 18:11:40,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:40,237 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:11:40,237 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:11:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t835~0.base_37|) (= v_~y$r_buff1_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t835~0.offset_26| 0) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t835~0.base_37| 4)) (= 0 v_~y$r_buff0_thd2~0_193) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37|) |v_ULTIMATE.start_main_~#t835~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t835~0.offset=|v_ULTIMATE.start_main_~#t835~0.offset_26|, 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_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t835~0.base=|v_ULTIMATE.start_main_~#t835~0.base_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t835~0.offset, 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, ULTIMATE.start_main_~#t835~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ULTIMATE.start_main_~#t836~0.offset, ~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, ~__unbuffered_p0_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, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t836~0.base, ~__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:11:40,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12|) |v_ULTIMATE.start_main_~#t836~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t836~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t836~0.base_12| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t836~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t836~0.offset_10|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_12|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t836~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t836~0.base, #length] because there is no mapped edge [2019-11-28 18:11:40,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff0_thd0~0_In159540556 ~y$r_buff1_thd0~0_Out159540556) (= 1 ~y$r_buff0_thd2~0_Out159540556) (= 1 ~z~0_Out159540556) (= ~y$r_buff0_thd1~0_In159540556 ~y$r_buff1_thd1~0_Out159540556) (= ~y$r_buff0_thd2~0_In159540556 ~y$r_buff1_thd2~0_Out159540556) (= ~z~0_Out159540556 ~__unbuffered_p1_EAX~0_Out159540556) (= ~__unbuffered_p1_EBX~0_Out159540556 ~a~0_In159540556) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In159540556))) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In159540556, ~a~0=~a~0_In159540556, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In159540556, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In159540556, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In159540556} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out159540556, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In159540556, ~a~0=~a~0_In159540556, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out159540556, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out159540556, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out159540556, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In159540556, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out159540556, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In159540556, ~z~0=~z~0_Out159540556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out159540556} 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:11:40,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1656391747 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1656391747 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1656391747| 0)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1656391747| ~y$w_buff0_used~0_In-1656391747) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1656391747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1656391747} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1656391747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1656391747, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1656391747|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:11:40,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1717315541 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1717315541 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1717315541 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1717315541 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out1717315541| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1717315541| ~y$w_buff1_used~0_In1717315541) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1717315541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1717315541, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1717315541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1717315541} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1717315541, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1717315541|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1717315541, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1717315541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1717315541} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:11:40,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:11:40,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In559513374 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In559513374 256)))) (or (and (= (mod ~y$w_buff1_used~0_In559513374 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In559513374 256)) (and (= (mod ~y$r_buff1_thd1~0_In559513374 256) 0) .cse0))) (= |P0Thread1of1ForFork0_#t~ite23_Out559513374| ~y$r_buff1_thd1~0_In559513374) (= |P0Thread1of1ForFork0_#t~ite24_Out559513374| |P0Thread1of1ForFork0_#t~ite23_Out559513374|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite24_Out559513374| ~y$r_buff1_thd1~0_In559513374) (= |P0Thread1of1ForFork0_#t~ite23_In559513374| |P0Thread1of1ForFork0_#t~ite23_Out559513374|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In559513374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559513374, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In559513374, ~weak$$choice2~0=~weak$$choice2~0_In559513374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In559513374, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In559513374|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In559513374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559513374, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In559513374, ~weak$$choice2~0=~weak$$choice2~0_In559513374, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out559513374|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out559513374|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In559513374} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-11-28 18:11:40,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:11:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In436369307 256))) (.cse0 (= ~y$r_buff0_thd2~0_In436369307 ~y$r_buff0_thd2~0_Out436369307)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In436369307 256)))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd2~0_Out436369307) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In436369307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In436369307} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out436369307|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In436369307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out436369307} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:11:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-1285936870 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1285936870 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1285936870 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1285936870 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1285936870| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite31_Out-1285936870| ~y$r_buff1_thd2~0_In-1285936870) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285936870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285936870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285936870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285936870} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285936870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285936870, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1285936870|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285936870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285936870} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:11:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:11:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:11:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2087168491 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2087168491 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out2087168491| ~y$w_buff1~0_In2087168491) (not .cse1)) (and (= ~y~0_In2087168491 |ULTIMATE.start_main_#t~ite34_Out2087168491|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2087168491, ~y~0=~y~0_In2087168491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2087168491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2087168491} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2087168491, ~y~0=~y~0_In2087168491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2087168491, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2087168491|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2087168491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In349360234 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In349360234 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out349360234|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In349360234 |ULTIMATE.start_main_#t~ite36_Out349360234|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In349360234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In349360234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In349360234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In349360234, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out349360234|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:11:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In512317041 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In512317041 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In512317041 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In512317041 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out512317041| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out512317041| ~y$w_buff1_used~0_In512317041)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In512317041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512317041, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In512317041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In512317041} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In512317041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512317041, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out512317041|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In512317041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In512317041} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:11:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1688230287 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1688230287 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1688230287| ~y$r_buff0_thd0~0_In1688230287) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1688230287| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1688230287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1688230287} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1688230287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1688230287, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1688230287|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:11:40,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1567598857 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1567598857 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1567598857 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1567598857 256)))) (or (and (= ~y$r_buff1_thd0~0_In-1567598857 |ULTIMATE.start_main_#t~ite39_Out-1567598857|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1567598857|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1567598857, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1567598857, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1567598857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1567598857} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1567598857, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1567598857|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1567598857, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1567598857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1567598857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:11:40,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} 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:11:40,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:11:40 BasicIcfg [2019-11-28 18:11:40,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:11:40,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:11:40,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:11:40,332 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:11:40,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:25" (3/4) ... [2019-11-28 18:11:40,336 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:11:40,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t835~0.base_37|) (= v_~y$r_buff1_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t835~0.offset_26| 0) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t835~0.base_37| 4)) (= 0 v_~y$r_buff0_thd2~0_193) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37|) |v_ULTIMATE.start_main_~#t835~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t835~0.offset=|v_ULTIMATE.start_main_~#t835~0.offset_26|, 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_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t835~0.base=|v_ULTIMATE.start_main_~#t835~0.base_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t835~0.offset, 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, ULTIMATE.start_main_~#t835~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ULTIMATE.start_main_~#t836~0.offset, ~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, ~__unbuffered_p0_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, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t836~0.base, ~__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:11:40,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12|) |v_ULTIMATE.start_main_~#t836~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t836~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t836~0.base_12| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t836~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t836~0.offset_10|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_12|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t836~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t836~0.base, #length] because there is no mapped edge [2019-11-28 18:11:40,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff0_thd0~0_In159540556 ~y$r_buff1_thd0~0_Out159540556) (= 1 ~y$r_buff0_thd2~0_Out159540556) (= 1 ~z~0_Out159540556) (= ~y$r_buff0_thd1~0_In159540556 ~y$r_buff1_thd1~0_Out159540556) (= ~y$r_buff0_thd2~0_In159540556 ~y$r_buff1_thd2~0_Out159540556) (= ~z~0_Out159540556 ~__unbuffered_p1_EAX~0_Out159540556) (= ~__unbuffered_p1_EBX~0_Out159540556 ~a~0_In159540556) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In159540556))) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In159540556, ~a~0=~a~0_In159540556, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In159540556, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In159540556, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In159540556} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out159540556, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In159540556, ~a~0=~a~0_In159540556, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out159540556, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out159540556, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out159540556, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In159540556, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out159540556, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In159540556, ~z~0=~z~0_Out159540556, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out159540556} 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:11:40,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1656391747 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1656391747 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1656391747| 0)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1656391747| ~y$w_buff0_used~0_In-1656391747) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1656391747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1656391747} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1656391747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1656391747, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1656391747|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:11:40,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1717315541 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1717315541 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1717315541 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1717315541 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out1717315541| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1717315541| ~y$w_buff1_used~0_In1717315541) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1717315541, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1717315541, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1717315541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1717315541} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1717315541, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1717315541|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1717315541, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1717315541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1717315541} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:11:40,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:11:40,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In559513374 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In559513374 256)))) (or (and (= (mod ~y$w_buff1_used~0_In559513374 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In559513374 256)) (and (= (mod ~y$r_buff1_thd1~0_In559513374 256) 0) .cse0))) (= |P0Thread1of1ForFork0_#t~ite23_Out559513374| ~y$r_buff1_thd1~0_In559513374) (= |P0Thread1of1ForFork0_#t~ite24_Out559513374| |P0Thread1of1ForFork0_#t~ite23_Out559513374|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite24_Out559513374| ~y$r_buff1_thd1~0_In559513374) (= |P0Thread1of1ForFork0_#t~ite23_In559513374| |P0Thread1of1ForFork0_#t~ite23_Out559513374|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In559513374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559513374, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In559513374, ~weak$$choice2~0=~weak$$choice2~0_In559513374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In559513374, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In559513374|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In559513374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559513374, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In559513374, ~weak$$choice2~0=~weak$$choice2~0_In559513374, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out559513374|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out559513374|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In559513374} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-11-28 18:11:40,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:11:40,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In436369307 256))) (.cse0 (= ~y$r_buff0_thd2~0_In436369307 ~y$r_buff0_thd2~0_Out436369307)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In436369307 256)))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd2~0_Out436369307) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In436369307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In436369307} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out436369307|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In436369307, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out436369307} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:11:40,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-1285936870 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1285936870 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1285936870 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1285936870 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1285936870| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite31_Out-1285936870| ~y$r_buff1_thd2~0_In-1285936870) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285936870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285936870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285936870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285936870} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285936870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285936870, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1285936870|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285936870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285936870} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:11:40,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:11:40,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:11:40,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2087168491 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2087168491 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out2087168491| ~y$w_buff1~0_In2087168491) (not .cse1)) (and (= ~y~0_In2087168491 |ULTIMATE.start_main_#t~ite34_Out2087168491|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2087168491, ~y~0=~y~0_In2087168491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2087168491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2087168491} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2087168491, ~y~0=~y~0_In2087168491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2087168491, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2087168491|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2087168491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:40,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:40,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In349360234 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In349360234 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out349360234|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In349360234 |ULTIMATE.start_main_#t~ite36_Out349360234|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In349360234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In349360234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In349360234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In349360234, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out349360234|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:11:40,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In512317041 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In512317041 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In512317041 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In512317041 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out512317041| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out512317041| ~y$w_buff1_used~0_In512317041)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In512317041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512317041, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In512317041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In512317041} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In512317041, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In512317041, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out512317041|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In512317041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In512317041} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:11:40,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1688230287 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1688230287 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1688230287| ~y$r_buff0_thd0~0_In1688230287) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1688230287| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1688230287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1688230287} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1688230287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1688230287, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1688230287|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:11:40,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1567598857 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1567598857 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1567598857 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1567598857 256)))) (or (and (= ~y$r_buff1_thd0~0_In-1567598857 |ULTIMATE.start_main_#t~ite39_Out-1567598857|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1567598857|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1567598857, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1567598857, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1567598857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1567598857} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1567598857, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1567598857|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1567598857, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1567598857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1567598857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:11:40,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} 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:11:40,434 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:11:40,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:11:40,437 INFO L168 Benchmark]: Toolchain (without parser) took 16086.24 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 453.0 MB). Free memory was 955.0 MB in the beginning and 1.3 GB in the end (delta: -351.9 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:40,437 INFO L168 Benchmark]: CDTParser took 0.30 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:11:40,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -88.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:40,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:11:40,439 INFO L168 Benchmark]: Boogie Preprocessor took 52.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 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:11:40,439 INFO L168 Benchmark]: RCFGBuilder took 778.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 990.6 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:40,440 INFO L168 Benchmark]: TraceAbstraction took 14384.94 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 371.2 MB). Free memory was 990.6 MB in the beginning and 1.3 GB in the end (delta: -329.0 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:40,440 INFO L168 Benchmark]: Witness Printer took 103.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:40,442 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.30 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 701.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -88.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 778.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 990.6 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14384.94 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 371.2 MB). Free memory was 990.6 MB in the beginning and 1.3 GB in the end (delta: -329.0 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. * Witness Printer took 103.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L746] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L787] 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) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 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) [L747] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L747] 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)) [L748] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L748] 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)) [L749] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L749] 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)) [L750] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_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))=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] [L750] 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)) [L752] 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)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L789] 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 [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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 [L821] 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, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1708 SDtfs, 1344 SDslu, 2675 SDs, 0 SdLazy, 1514 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10870occurred 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.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 7322 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 46062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...