./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef0628b20db46bc14cfcc47365ed24e38ce755d5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:22:08,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:22:08,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:22:08,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:22:08,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:22:08,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:22:08,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:22:08,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:22:08,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:22:08,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:22:08,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:22:08,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:22:08,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:22:08,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:22:08,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:22:08,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:22:08,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:22:08,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:22:08,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:22:08,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:22:08,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:22:08,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:22:08,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:22:08,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:22:08,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:22:08,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:22:08,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:22:08,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:22:08,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:22:08,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:22:08,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:22:08,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:22:08,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:22:08,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:22:08,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:22:08,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:22:08,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:22:08,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:22:08,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:22:08,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:22:08,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:22:08,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:22:08,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:22:08,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:22:08,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:22:08,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:22:08,200 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:22:08,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:22:08,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:22:08,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:22:08,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:22:08,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:22:08,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:22:08,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:22:08,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:22:08,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:22:08,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:22:08,204 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:22:08,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:22:08,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:22:08,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:22:08,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:22:08,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:22:08,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:08,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:22:08,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:22:08,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:22:08,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:22:08,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:22:08,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:22:08,207 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:22:08,208 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 -> ef0628b20db46bc14cfcc47365ed24e38ce755d5 [2019-11-28 18:22:08,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:22:08,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:22:08,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:22:08,543 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:22:08,543 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:22:08,544 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i [2019-11-28 18:22:08,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a91b72f/1e9f92f0b2694d0aaf1d3bb5ab37f372/FLAGa8ac57710 [2019-11-28 18:22:09,227 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:22:09,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i [2019-11-28 18:22:09,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a91b72f/1e9f92f0b2694d0aaf1d3bb5ab37f372/FLAGa8ac57710 [2019-11-28 18:22:09,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a91b72f/1e9f92f0b2694d0aaf1d3bb5ab37f372 [2019-11-28 18:22:09,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:22:09,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:22:09,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:09,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:22:09,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:22:09,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:09" (1/1) ... [2019-11-28 18:22:09,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc9a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:09, skipping insertion in model container [2019-11-28 18:22:09,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:09" (1/1) ... [2019-11-28 18:22:09,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:22:09,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:22:10,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:10,086 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:22:10,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:10,242 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:22:10,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10 WrapperNode [2019-11-28 18:22:10,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:10,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:10,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:22:10,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:22:10,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:10,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:22:10,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:22:10,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:22:10,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:22:10,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:22:10,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:22:10,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:22:10,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:10,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:22:10,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:22:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:22:10,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:22:10,451 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:22:10,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:22:10,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:22:10,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:22:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:22:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:22:10,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:22:10,455 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:22:11,167 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:22:11,168 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:22:11,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:11 BoogieIcfgContainer [2019-11-28 18:22:11,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:22:11,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:22:11,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:22:11,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:22:11,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:22:09" (1/3) ... [2019-11-28 18:22:11,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa1e395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:11, skipping insertion in model container [2019-11-28 18:22:11,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10" (2/3) ... [2019-11-28 18:22:11,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa1e395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:11, skipping insertion in model container [2019-11-28 18:22:11,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:11" (3/3) ... [2019-11-28 18:22:11,182 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc.i [2019-11-28 18:22:11,194 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:22:11,194 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:22:11,206 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:22:11,207 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:22:11,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,252 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,253 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:11,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:22:11,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:22:11,329 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:22:11,329 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:22:11,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:22:11,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:22:11,330 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:22:11,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:22:11,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:22:11,347 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-11-28 18:22:11,349 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:11,430 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:11,430 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:11,447 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:11,467 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:11,509 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:11,510 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:11,515 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:11,530 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:22:11,532 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:22:16,086 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:22:16,232 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:22:16,278 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-11-28 18:22:16,278 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-11-28 18:22:16,282 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-11-28 18:22:16,713 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-11-28 18:22:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-11-28 18:22:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:22:16,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:16,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:22:16,730 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:16,740 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-11-28 18:22:16,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:16,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657424344] [2019-11-28 18:22:16,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:17,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657424344] [2019-11-28 18:22:17,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:17,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:17,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047085372] [2019-11-28 18:22:17,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:17,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:17,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:17,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:17,248 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-11-28 18:22:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:17,551 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-11-28 18:22:17,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:17,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:22:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:17,653 INFO L225 Difference]: With dead ends: 5990 [2019-11-28 18:22:17,657 INFO L226 Difference]: Without dead ends: 5642 [2019-11-28 18:22:17,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-11-28 18:22:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-11-28 18:22:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-11-28 18:22:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-11-28 18:22:17,986 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-11-28 18:22:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:17,987 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-11-28 18:22:17,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-11-28 18:22:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:22:17,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:17,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:17,991 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-11-28 18:22:17,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:17,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25124519] [2019-11-28 18:22:17,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:18,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25124519] [2019-11-28 18:22:18,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:18,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:18,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131872496] [2019-11-28 18:22:18,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:18,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:18,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:18,065 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-11-28 18:22:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:18,422 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-11-28 18:22:18,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:18,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:22:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:18,498 INFO L225 Difference]: With dead ends: 8500 [2019-11-28 18:22:18,498 INFO L226 Difference]: Without dead ends: 8487 [2019-11-28 18:22:18,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-11-28 18:22:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-11-28 18:22:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-11-28 18:22:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-11-28 18:22:18,808 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-11-28 18:22:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:18,809 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-11-28 18:22:18,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-11-28 18:22:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:18,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:18,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:18,815 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:18,816 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-11-28 18:22:18,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:18,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440765908] [2019-11-28 18:22:18,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:18,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440765908] [2019-11-28 18:22:18,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:18,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:18,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695903485] [2019-11-28 18:22:18,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:18,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:18,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:18,869 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-11-28 18:22:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:18,977 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-11-28 18:22:18,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:18,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:22:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:19,022 INFO L225 Difference]: With dead ends: 10006 [2019-11-28 18:22:19,022 INFO L226 Difference]: Without dead ends: 10006 [2019-11-28 18:22:19,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-11-28 18:22:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-11-28 18:22:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-11-28 18:22:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-11-28 18:22:19,481 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-11-28 18:22:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:19,483 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-11-28 18:22:19,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-11-28 18:22:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:19,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:19,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:19,487 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-11-28 18:22:19,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:19,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795041650] [2019-11-28 18:22:19,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:19,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795041650] [2019-11-28 18:22:19,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:19,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:19,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114688852] [2019-11-28 18:22:19,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:19,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:19,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:19,599 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-11-28 18:22:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:19,813 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-11-28 18:22:19,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:19,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:19,852 INFO L225 Difference]: With dead ends: 10925 [2019-11-28 18:22:19,852 INFO L226 Difference]: Without dead ends: 10913 [2019-11-28 18:22:19,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-11-28 18:22:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-11-28 18:22:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-11-28 18:22:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-11-28 18:22:20,201 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-11-28 18:22:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:20,201 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-11-28 18:22:20,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-11-28 18:22:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:20,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:20,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:20,205 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-11-28 18:22:20,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:20,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414567629] [2019-11-28 18:22:20,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:20,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414567629] [2019-11-28 18:22:20,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:20,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:20,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154255427] [2019-11-28 18:22:20,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:20,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:20,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:20,279 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-11-28 18:22:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:20,478 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-11-28 18:22:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:20,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:20,516 INFO L225 Difference]: With dead ends: 11905 [2019-11-28 18:22:20,517 INFO L226 Difference]: Without dead ends: 11891 [2019-11-28 18:22:20,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-11-28 18:22:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-11-28 18:22:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-11-28 18:22:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-11-28 18:22:20,854 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-11-28 18:22:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:20,855 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-11-28 18:22:20,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-11-28 18:22:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:20,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:20,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:20,861 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-11-28 18:22:20,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:20,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115047646] [2019-11-28 18:22:20,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:20,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115047646] [2019-11-28 18:22:20,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:20,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:20,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833635601] [2019-11-28 18:22:20,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:20,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:20,941 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-11-28 18:22:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:20,993 INFO L93 Difference]: Finished difference Result 9230 states and 29799 transitions. [2019-11-28 18:22:20,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:20,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:21,023 INFO L225 Difference]: With dead ends: 9230 [2019-11-28 18:22:21,023 INFO L226 Difference]: Without dead ends: 9230 [2019-11-28 18:22:21,024 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:22:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9230 states. [2019-11-28 18:22:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9230 to 9070. [2019-11-28 18:22:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-11-28 18:22:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 29315 transitions. [2019-11-28 18:22:21,404 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 29315 transitions. Word has length 16 [2019-11-28 18:22:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:21,405 INFO L462 AbstractCegarLoop]: Abstraction has 9070 states and 29315 transitions. [2019-11-28 18:22:21,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 29315 transitions. [2019-11-28 18:22:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:21,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:21,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:21,413 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:21,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1352148399, now seen corresponding path program 1 times [2019-11-28 18:22:21,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:21,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393289772] [2019-11-28 18:22:21,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:21,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393289772] [2019-11-28 18:22:21,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:21,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:21,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398817257] [2019-11-28 18:22:21,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:21,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:21,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:21,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:21,532 INFO L87 Difference]: Start difference. First operand 9070 states and 29315 transitions. Second operand 3 states. [2019-11-28 18:22:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:21,612 INFO L93 Difference]: Finished difference Result 15494 states and 49825 transitions. [2019-11-28 18:22:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:21,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:21,647 INFO L225 Difference]: With dead ends: 15494 [2019-11-28 18:22:21,647 INFO L226 Difference]: Without dead ends: 14910 [2019-11-28 18:22:21,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14910 states. [2019-11-28 18:22:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14910 to 14339. [2019-11-28 18:22:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14339 states. [2019-11-28 18:22:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14339 states to 14339 states and 46700 transitions. [2019-11-28 18:22:22,085 INFO L78 Accepts]: Start accepts. Automaton has 14339 states and 46700 transitions. Word has length 16 [2019-11-28 18:22:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,085 INFO L462 AbstractCegarLoop]: Abstraction has 14339 states and 46700 transitions. [2019-11-28 18:22:22,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 14339 states and 46700 transitions. [2019-11-28 18:22:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:22:22,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:22,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1236852315, now seen corresponding path program 1 times [2019-11-28 18:22:22,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224383878] [2019-11-28 18:22:22,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:22,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224383878] [2019-11-28 18:22:22,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:22,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772024415] [2019-11-28 18:22:22,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:22,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:22,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:22,175 INFO L87 Difference]: Start difference. First operand 14339 states and 46700 transitions. Second operand 4 states. [2019-11-28 18:22:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,283 INFO L93 Difference]: Finished difference Result 14188 states and 46235 transitions. [2019-11-28 18:22:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:22,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:22:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,324 INFO L225 Difference]: With dead ends: 14188 [2019-11-28 18:22:22,324 INFO L226 Difference]: Without dead ends: 14084 [2019-11-28 18:22:22,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:22:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14084 states. [2019-11-28 18:22:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14084 to 14084. [2019-11-28 18:22:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14084 states. [2019-11-28 18:22:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14084 states to 14084 states and 45897 transitions. [2019-11-28 18:22:22,730 INFO L78 Accepts]: Start accepts. Automaton has 14084 states and 45897 transitions. Word has length 17 [2019-11-28 18:22:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,731 INFO L462 AbstractCegarLoop]: Abstraction has 14084 states and 45897 transitions. [2019-11-28 18:22:22,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 14084 states and 45897 transitions. [2019-11-28 18:22:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:22:22,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:22,744 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2069901673, now seen corresponding path program 1 times [2019-11-28 18:22:22,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25805911] [2019-11-28 18:22:22,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:22,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25805911] [2019-11-28 18:22:22,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:22,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022076644] [2019-11-28 18:22:22,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:22,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:22,788 INFO L87 Difference]: Start difference. First operand 14084 states and 45897 transitions. Second operand 3 states. [2019-11-28 18:22:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,806 INFO L93 Difference]: Finished difference Result 1973 states and 4784 transitions. [2019-11-28 18:22:22,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:22,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:22:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,811 INFO L225 Difference]: With dead ends: 1973 [2019-11-28 18:22:22,812 INFO L226 Difference]: Without dead ends: 1973 [2019-11-28 18:22:22,812 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:22:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2019-11-28 18:22:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1973. [2019-11-28 18:22:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-11-28 18:22:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 4784 transitions. [2019-11-28 18:22:22,850 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 4784 transitions. Word has length 19 [2019-11-28 18:22:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,851 INFO L462 AbstractCegarLoop]: Abstraction has 1973 states and 4784 transitions. [2019-11-28 18:22:22,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 4784 transitions. [2019-11-28 18:22:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:22,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:22,856 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,857 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-11-28 18:22:22,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141222711] [2019-11-28 18:22:22,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:22,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141222711] [2019-11-28 18:22:22,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:22,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641603558] [2019-11-28 18:22:22,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:22,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:22,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:22,957 INFO L87 Difference]: Start difference. First operand 1973 states and 4784 transitions. Second operand 5 states. [2019-11-28 18:22:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,187 INFO L93 Difference]: Finished difference Result 2552 states and 6074 transitions. [2019-11-28 18:22:23,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:23,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:22:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,192 INFO L225 Difference]: With dead ends: 2552 [2019-11-28 18:22:23,193 INFO L226 Difference]: Without dead ends: 2516 [2019-11-28 18:22:23,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-11-28 18:22:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2056. [2019-11-28 18:22:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-11-28 18:22:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 4961 transitions. [2019-11-28 18:22:23,244 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 4961 transitions. Word has length 26 [2019-11-28 18:22:23,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,244 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 4961 transitions. [2019-11-28 18:22:23,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:23,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 4961 transitions. [2019-11-28 18:22:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:23,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:23,362 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:23,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-11-28 18:22:23,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966379732] [2019-11-28 18:22:23,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:23,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966379732] [2019-11-28 18:22:23,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:23,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610068554] [2019-11-28 18:22:23,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:23,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:23,484 INFO L87 Difference]: Start difference. First operand 2056 states and 4961 transitions. Second operand 5 states. [2019-11-28 18:22:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,664 INFO L93 Difference]: Finished difference Result 2314 states and 5527 transitions. [2019-11-28 18:22:23,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:22:23,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,669 INFO L225 Difference]: With dead ends: 2314 [2019-11-28 18:22:23,669 INFO L226 Difference]: Without dead ends: 2314 [2019-11-28 18:22:23,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-11-28 18:22:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2115. [2019-11-28 18:22:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-11-28 18:22:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 5071 transitions. [2019-11-28 18:22:23,704 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 5071 transitions. Word has length 27 [2019-11-28 18:22:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,704 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 5071 transitions. [2019-11-28 18:22:23,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 5071 transitions. [2019-11-28 18:22:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:23,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:23,709 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-11-28 18:22:23,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172450244] [2019-11-28 18:22:23,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:23,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172450244] [2019-11-28 18:22:23,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:23,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461023051] [2019-11-28 18:22:23,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:23,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:23,785 INFO L87 Difference]: Start difference. First operand 2115 states and 5071 transitions. Second operand 5 states. [2019-11-28 18:22:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,981 INFO L93 Difference]: Finished difference Result 2498 states and 5944 transitions. [2019-11-28 18:22:23,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:23,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,985 INFO L225 Difference]: With dead ends: 2498 [2019-11-28 18:22:23,985 INFO L226 Difference]: Without dead ends: 2462 [2019-11-28 18:22:23,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-11-28 18:22:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2055. [2019-11-28 18:22:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-11-28 18:22:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4955 transitions. [2019-11-28 18:22:24,021 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4955 transitions. Word has length 27 [2019-11-28 18:22:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,022 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 4955 transitions. [2019-11-28 18:22:24,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4955 transitions. [2019-11-28 18:22:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:22:24,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:24,026 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:24,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-11-28 18:22:24,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97484522] [2019-11-28 18:22:24,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:24,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97484522] [2019-11-28 18:22:24,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:24,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792332814] [2019-11-28 18:22:24,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:24,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:24,081 INFO L87 Difference]: Start difference. First operand 2055 states and 4955 transitions. Second operand 4 states. [2019-11-28 18:22:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,105 INFO L93 Difference]: Finished difference Result 966 states and 2264 transitions. [2019-11-28 18:22:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:24,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:22:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,107 INFO L225 Difference]: With dead ends: 966 [2019-11-28 18:22:24,107 INFO L226 Difference]: Without dead ends: 966 [2019-11-28 18:22:24,108 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:22:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-28 18:22:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 658. [2019-11-28 18:22:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-28 18:22:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1494 transitions. [2019-11-28 18:22:24,121 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1494 transitions. Word has length 28 [2019-11-28 18:22:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,122 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1494 transitions. [2019-11-28 18:22:24,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1494 transitions. [2019-11-28 18:22:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:24,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:24,125 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:24,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1254925043, now seen corresponding path program 1 times [2019-11-28 18:22:24,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434691946] [2019-11-28 18:22:24,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:24,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434691946] [2019-11-28 18:22:24,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:22:24,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100008951] [2019-11-28 18:22:24,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:22:24,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:22:24,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:24,393 INFO L87 Difference]: Start difference. First operand 658 states and 1494 transitions. Second operand 11 states. [2019-11-28 18:22:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:26,557 INFO L93 Difference]: Finished difference Result 2669 states and 5959 transitions. [2019-11-28 18:22:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 18:22:26,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-11-28 18:22:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:26,562 INFO L225 Difference]: With dead ends: 2669 [2019-11-28 18:22:26,562 INFO L226 Difference]: Without dead ends: 1496 [2019-11-28 18:22:26,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2019-11-28 18:22:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-11-28 18:22:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 747. [2019-11-28 18:22:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-28 18:22:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1700 transitions. [2019-11-28 18:22:26,581 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1700 transitions. Word has length 42 [2019-11-28 18:22:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:26,582 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1700 transitions. [2019-11-28 18:22:26,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:22:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1700 transitions. [2019-11-28 18:22:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:26,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:26,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:26,585 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:26,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1487589225, now seen corresponding path program 2 times [2019-11-28 18:22:26,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:26,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65869727] [2019-11-28 18:22:26,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:26,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65869727] [2019-11-28 18:22:26,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:26,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:22:26,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544757419] [2019-11-28 18:22:26,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:22:26,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:26,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:22:26,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:26,736 INFO L87 Difference]: Start difference. First operand 747 states and 1700 transitions. Second operand 6 states. [2019-11-28 18:22:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:26,925 INFO L93 Difference]: Finished difference Result 1471 states and 3253 transitions. [2019-11-28 18:22:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:22:26,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-28 18:22:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:26,927 INFO L225 Difference]: With dead ends: 1471 [2019-11-28 18:22:26,927 INFO L226 Difference]: Without dead ends: 1167 [2019-11-28 18:22:26,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-11-28 18:22:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 757. [2019-11-28 18:22:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-11-28 18:22:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1712 transitions. [2019-11-28 18:22:26,942 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1712 transitions. Word has length 42 [2019-11-28 18:22:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:26,942 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1712 transitions. [2019-11-28 18:22:26,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:22:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1712 transitions. [2019-11-28 18:22:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:26,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:26,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:26,945 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1626226089, now seen corresponding path program 3 times [2019-11-28 18:22:26,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:26,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640268274] [2019-11-28 18:22:26,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:22:27,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640268274] [2019-11-28 18:22:27,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:27,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:27,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60298209] [2019-11-28 18:22:27,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:27,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:27,053 INFO L87 Difference]: Start difference. First operand 757 states and 1712 transitions. Second operand 4 states. [2019-11-28 18:22:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:27,073 INFO L93 Difference]: Finished difference Result 1167 states and 2665 transitions. [2019-11-28 18:22:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:27,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-28 18:22:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:27,075 INFO L225 Difference]: With dead ends: 1167 [2019-11-28 18:22:27,075 INFO L226 Difference]: Without dead ends: 438 [2019-11-28 18:22:27,075 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:22:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-28 18:22:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-11-28 18:22:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-28 18:22:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1001 transitions. [2019-11-28 18:22:27,083 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1001 transitions. Word has length 42 [2019-11-28 18:22:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:27,083 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1001 transitions. [2019-11-28 18:22:27,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1001 transitions. [2019-11-28 18:22:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:27,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:27,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:27,086 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:27,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:27,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 4 times [2019-11-28 18:22:27,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:27,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860939638] [2019-11-28 18:22:27,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:27,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:27,210 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:27,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35|) 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35|) |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| 4)) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1633~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= (store .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35| 1) |v_#valid_59|) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_35|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_24|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1633~0.base=|v_ULTIMATE.start_main_~#t1633~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1633~0.offset=|v_ULTIMATE.start_main_~#t1633~0.offset_24|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1634~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1634~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1633~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1633~0.offset, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:27,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10|) |v_ULTIMATE.start_main_~#t1634~0.offset_9| 1)) |v_#memory_int_9|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1634~0.base_10|) (= |v_ULTIMATE.start_main_~#t1634~0.offset_9| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1634~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1634~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1634~0.offset] because there is no mapped edge [2019-11-28 18:22:27,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= 1 ~y~0_Out-536900930) (= ~x$r_buff1_thd0~0_Out-536900930 ~x$r_buff0_thd0~0_In-536900930) (= ~__unbuffered_p1_EBX~0_Out-536900930 ~y~0_Out-536900930) (= 1 ~x$r_buff0_thd2~0_Out-536900930) (= ~x$r_buff1_thd2~0_Out-536900930 ~x$r_buff0_thd2~0_In-536900930) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-536900930)) (= ~x$r_buff0_thd1~0_In-536900930 ~x$r_buff1_thd1~0_Out-536900930) (= ~__unbuffered_p1_EAX~0_Out-536900930 ~y~0_Out-536900930)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-536900930, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-536900930, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-536900930, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-536900930} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-536900930, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-536900930, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-536900930, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-536900930, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-536900930, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-536900930, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-536900930, ~y~0=~y~0_Out-536900930, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-536900930, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-536900930} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:27,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:22:27,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In159540556 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite24_Out159540556| ~x$r_buff1_thd1~0_In159540556) (= |P0Thread1of1ForFork1_#t~ite22_In159540556| |P0Thread1of1ForFork1_#t~ite22_Out159540556|) (= |P0Thread1of1ForFork1_#t~ite23_In159540556| |P0Thread1of1ForFork1_#t~ite23_Out159540556|) (not .cse0)) (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In159540556 256) 0)))) (and .cse0 (not (= 0 (mod ~x$w_buff0_used~0_In159540556 256))) (or (not (= 0 (mod ~x$w_buff1_used~0_In159540556 256))) .cse1) (or (not (= 0 (mod ~x$r_buff1_thd1~0_In159540556 256))) .cse1) (= |P0Thread1of1ForFork1_#t~ite24_Out159540556| |P0Thread1of1ForFork1_#t~ite23_Out159540556|) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out159540556|) (= |P0Thread1of1ForFork1_#t~ite23_Out159540556| |P0Thread1of1ForFork1_#t~ite22_Out159540556|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In159540556, ~x$w_buff1_used~0=~x$w_buff1_used~0_In159540556, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In159540556, ~weak$$choice2~0=~weak$$choice2~0_In159540556, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In159540556|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In159540556, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In159540556|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In159540556, ~x$w_buff1_used~0=~x$w_buff1_used~0_In159540556, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In159540556, ~weak$$choice2~0=~weak$$choice2~0_In159540556, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out159540556|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out159540556|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out159540556|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In159540556} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:27,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:22:27,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1213475763 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1213475763 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1213475763| ~x$w_buff0_used~0_In-1213475763)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1213475763| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1213475763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1213475763} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1213475763, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1213475763|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1213475763} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:27,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In349360234 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In349360234 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In349360234 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In349360234 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out349360234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In349360234 |P1Thread1of1ForFork0_#t~ite29_Out349360234|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In349360234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In349360234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In349360234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In349360234} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In349360234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In349360234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In349360234, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out349360234|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In349360234} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:27,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-640854589 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-640854589 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_In-640854589 ~x$r_buff0_thd2~0_Out-640854589))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd2~0_Out-640854589 0) (not .cse1) (not .cse2)) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-640854589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-640854589} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-640854589|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-640854589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-640854589} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:27,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1830401781 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1830401781 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1830401781 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1830401781 256)))) (or (and (= ~x$r_buff1_thd2~0_In-1830401781 |P1Thread1of1ForFork0_#t~ite31_Out-1830401781|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1830401781|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1830401781, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1830401781, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1830401781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1830401781} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1830401781|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1830401781, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1830401781, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1830401781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1830401781} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:27,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:27,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:22:27,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2001711948 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2001711948 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-2001711948 |ULTIMATE.start_main_#t~ite34_Out-2001711948|)) (and (= ~x~0_In-2001711948 |ULTIMATE.start_main_#t~ite34_Out-2001711948|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2001711948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2001711948, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2001711948, ~x~0=~x~0_In-2001711948} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2001711948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2001711948, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2001711948, ~x~0=~x~0_In-2001711948, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2001711948|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:27,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:27,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1567598857 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1567598857 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1567598857| ~x$w_buff0_used~0_In-1567598857)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1567598857| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1567598857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1567598857} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1567598857, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1567598857|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1567598857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:27,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In2087168491 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2087168491 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2087168491 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In2087168491 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out2087168491| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2087168491 |ULTIMATE.start_main_#t~ite37_Out2087168491|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2087168491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2087168491, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2087168491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2087168491} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2087168491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2087168491, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2087168491|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2087168491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2087168491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:27,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In436369307 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In436369307 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out436369307| ~x$r_buff0_thd0~0_In436369307) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out436369307| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In436369307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In436369307} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In436369307, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out436369307|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In436369307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:27,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1191214179 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1191214179 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1191214179 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1191214179 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1191214179| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1191214179 |ULTIMATE.start_main_#t~ite39_Out-1191214179|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1191214179, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1191214179, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1191214179, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1191214179} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1191214179, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1191214179|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1191214179, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1191214179, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1191214179} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:27,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:27,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:27 BasicIcfg [2019-11-28 18:22:27,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:27,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:27,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:27,303 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:27,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:11" (3/4) ... [2019-11-28 18:22:27,306 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:27,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35|) 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1633~0.base_35|) |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1633~0.base_35| 4)) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= |v_ULTIMATE.start_main_~#t1633~0.offset_24| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1633~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= (store .cse0 |v_ULTIMATE.start_main_~#t1633~0.base_35| 1) |v_#valid_59|) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_35|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_24|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1633~0.base=|v_ULTIMATE.start_main_~#t1633~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1633~0.offset=|v_ULTIMATE.start_main_~#t1633~0.offset_24|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1634~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1634~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1633~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1633~0.offset, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:27,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1634~0.base_10|) |v_ULTIMATE.start_main_~#t1634~0.offset_9| 1)) |v_#memory_int_9|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1634~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1634~0.base_10|) (= |v_ULTIMATE.start_main_~#t1634~0.offset_9| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1634~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1634~0.base=|v_ULTIMATE.start_main_~#t1634~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1634~0.offset=|v_ULTIMATE.start_main_~#t1634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1634~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1634~0.offset] because there is no mapped edge [2019-11-28 18:22:27,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= 1 ~y~0_Out-536900930) (= ~x$r_buff1_thd0~0_Out-536900930 ~x$r_buff0_thd0~0_In-536900930) (= ~__unbuffered_p1_EBX~0_Out-536900930 ~y~0_Out-536900930) (= 1 ~x$r_buff0_thd2~0_Out-536900930) (= ~x$r_buff1_thd2~0_Out-536900930 ~x$r_buff0_thd2~0_In-536900930) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-536900930)) (= ~x$r_buff0_thd1~0_In-536900930 ~x$r_buff1_thd1~0_Out-536900930) (= ~__unbuffered_p1_EAX~0_Out-536900930 ~y~0_Out-536900930)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-536900930, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-536900930, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-536900930, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-536900930} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-536900930, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-536900930, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-536900930, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-536900930, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-536900930, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-536900930, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-536900930, ~y~0=~y~0_Out-536900930, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-536900930, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-536900930} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:27,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:22:27,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In159540556 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite24_Out159540556| ~x$r_buff1_thd1~0_In159540556) (= |P0Thread1of1ForFork1_#t~ite22_In159540556| |P0Thread1of1ForFork1_#t~ite22_Out159540556|) (= |P0Thread1of1ForFork1_#t~ite23_In159540556| |P0Thread1of1ForFork1_#t~ite23_Out159540556|) (not .cse0)) (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In159540556 256) 0)))) (and .cse0 (not (= 0 (mod ~x$w_buff0_used~0_In159540556 256))) (or (not (= 0 (mod ~x$w_buff1_used~0_In159540556 256))) .cse1) (or (not (= 0 (mod ~x$r_buff1_thd1~0_In159540556 256))) .cse1) (= |P0Thread1of1ForFork1_#t~ite24_Out159540556| |P0Thread1of1ForFork1_#t~ite23_Out159540556|) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out159540556|) (= |P0Thread1of1ForFork1_#t~ite23_Out159540556| |P0Thread1of1ForFork1_#t~ite22_Out159540556|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In159540556, ~x$w_buff1_used~0=~x$w_buff1_used~0_In159540556, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In159540556, ~weak$$choice2~0=~weak$$choice2~0_In159540556, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In159540556|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In159540556, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In159540556|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In159540556, ~x$w_buff1_used~0=~x$w_buff1_used~0_In159540556, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In159540556, ~weak$$choice2~0=~weak$$choice2~0_In159540556, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out159540556|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out159540556|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out159540556|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In159540556} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:27,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:22:27,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1213475763 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1213475763 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1213475763| ~x$w_buff0_used~0_In-1213475763)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1213475763| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1213475763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1213475763} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1213475763, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1213475763|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1213475763} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:27,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In349360234 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In349360234 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In349360234 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In349360234 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out349360234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In349360234 |P1Thread1of1ForFork0_#t~ite29_Out349360234|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In349360234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In349360234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In349360234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In349360234} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In349360234, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In349360234, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In349360234, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out349360234|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In349360234} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:27,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-640854589 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-640854589 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_In-640854589 ~x$r_buff0_thd2~0_Out-640854589))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd2~0_Out-640854589 0) (not .cse1) (not .cse2)) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-640854589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-640854589} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-640854589|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-640854589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-640854589} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:27,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1830401781 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1830401781 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1830401781 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1830401781 256)))) (or (and (= ~x$r_buff1_thd2~0_In-1830401781 |P1Thread1of1ForFork0_#t~ite31_Out-1830401781|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1830401781|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1830401781, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1830401781, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1830401781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1830401781} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1830401781|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1830401781, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1830401781, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1830401781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1830401781} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:27,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:27,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:22:27,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2001711948 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2001711948 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-2001711948 |ULTIMATE.start_main_#t~ite34_Out-2001711948|)) (and (= ~x~0_In-2001711948 |ULTIMATE.start_main_#t~ite34_Out-2001711948|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2001711948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2001711948, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2001711948, ~x~0=~x~0_In-2001711948} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2001711948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2001711948, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2001711948, ~x~0=~x~0_In-2001711948, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2001711948|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:27,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:27,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1567598857 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1567598857 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1567598857| ~x$w_buff0_used~0_In-1567598857)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1567598857| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1567598857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1567598857} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1567598857, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1567598857|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1567598857} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:27,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In2087168491 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2087168491 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2087168491 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In2087168491 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out2087168491| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2087168491 |ULTIMATE.start_main_#t~ite37_Out2087168491|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2087168491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2087168491, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2087168491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2087168491} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2087168491, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2087168491, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2087168491|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2087168491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2087168491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:27,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In436369307 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In436369307 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out436369307| ~x$r_buff0_thd0~0_In436369307) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out436369307| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In436369307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In436369307} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In436369307, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out436369307|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In436369307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:27,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1191214179 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1191214179 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1191214179 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1191214179 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1191214179| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1191214179 |ULTIMATE.start_main_#t~ite39_Out-1191214179|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1191214179, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1191214179, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1191214179, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1191214179} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1191214179, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1191214179|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1191214179, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1191214179, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1191214179} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:27,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:27,448 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:27,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:27,455 INFO L168 Benchmark]: Toolchain (without parser) took 17963.44 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 500.2 MB). Free memory was 946.9 MB in the beginning and 808.7 MB in the end (delta: 138.3 MB). Peak memory consumption was 638.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:27,455 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:27,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:27,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:27,457 INFO L168 Benchmark]: Boogie Preprocessor took 63.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:27,457 INFO L168 Benchmark]: RCFGBuilder took 798.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:27,460 INFO L168 Benchmark]: TraceAbstraction took 16131.51 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.7 MB). Free memory was 1.1 GB in the beginning and 833.0 MB in the end (delta: 233.6 MB). Peak memory consumption was 584.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:27,461 INFO L168 Benchmark]: Witness Printer took 146.19 ms. Allocated memory is still 1.5 GB. Free memory was 833.0 MB in the beginning and 808.7 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:27,468 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 755.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 798.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16131.51 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.7 MB). Free memory was 1.1 GB in the beginning and 833.0 MB in the end (delta: 233.6 MB). Peak memory consumption was 584.4 MB. Max. memory is 11.5 GB. * Witness Printer took 146.19 ms. Allocated memory is still 1.5 GB. Free memory was 833.0 MB in the beginning and 808.7 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1852 SDtfs, 1811 SDslu, 3373 SDs, 0 SdLazy, 2515 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14339occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 9173 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 56026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...